Results 31 to 40 of about 479,648 (240)
Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs
AKCE International Journal of Graphs and CombinatoricsInterval function of a graph is a well-known notion in metric graph theory and the axiomatic characterization using a set of first order axioms of different graph classes is an interesting problem in this area.
Jeny Jacob +4 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2017 This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) model ${\mathcal{M}}$ is given and the goal is to obtain an equivalent UCA model ${\mathcal{U}}$. In
openaire +3 more sources
Partitioning Perfect Graphs into Stars
, 2016 The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three
Bredereck, Robert +6 more
core +3 more sources
PLoS ONE, 2020 Implantable cardioverter defibrillators (ICD) are the most effective therapy to terminate malignant ventricular arrhythmias (VA) and therefore to prevent sudden cardiac death. Until today, there is no way to predict the onset of such VA.
Gabriel S Zamudio +2 more
doaj +2 more sources
Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem
Mathematics, 2016 The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj +1 more source
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj +1 more source
Automorphism Groups of Geometrically Represented Graphs [PDF]
, 2015 We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations.
Klavík, Pavel, Zeman, Peter
core
A new graph perspective on max-min fairness in Gaussian parallel channels
, 2008 In this work we are concerned with the problem of achieving max-min fairness in Gaussian parallel channels with respect to a general performance function, including channel capacity or decoding reliability as special cases.
Boche, Holger, Wiczanowski, Marcin
core +2 more sources
Correlation of the differential expression of PIK3R1 and its spliced variant, p55α, in pan‐cancer
Molecular Oncology, EarlyView.PIK3R1 undergoes alternative splicing to generate the isoforms, p85α and p55α. By combining large patient datasets with laboratory experiments, we show that PIK3R1 spliced variants shape cancer behavior. While tumors lose the protective p85α isoform, p55α is overexpressed, changes linked to poorer survival and more pronounced in African American ...
Ishita Gupta +10 more
wiley +1 more source
Quantifying Uncertainty in Brain Network Measures using Bayesian Connectomics
Frontiers in Computational Neuroscience, 2014 The wiring diagram of the human brain can be described in terms of graph measures that characterize structural regularities. These measures require an estimate of whole-brain structural connectivity for which one may resort to deterministic or ...
Ronald Johannes Janssen +4 more
doaj +1 more source