Results 251 to 260 of about 2,151,737 (304)
Some of the next articles are maybe not open access.
On a Decomposition of Complete Graphs
Graphs and Combinatorics, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadi Kharaghani, Rouzbeh Torabi
openaire +1 more source
Graph Ear Decompositions and Graph Embeddings
SIAM Journal on Discrete Mathematics, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianer Chen, Saroja P. Kanchi
openaire +1 more source
On the Decomposition of Graphs into Complete Bipartite Graphs
Graphs and Combinatorics, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinquan Dong, Yanpei Liu
openaire +2 more sources
Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications
Computer Vision and Pattern Recognition, 2016We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks, including ...
Evgeny Levinkov +9 more
semanticscholar +1 more source
Correlation-Driven Multi-Modality Graph Decomposition for Cross-Subject Emotion Recognition
ACM MultimediaMulti-modality physiological signal-based emotion recognition has attracted increasing attention as its capacity to capture human affective states comprehensively.
Wuliang Huang +8 more
semanticscholar +1 more source
On the Decomposition of Graphs
SIAM Journal on Algebraic Discrete Methods, 1981In this paper, we study the decompositions of a graph G into edge-disjoint subgraphs all of which belong to a specified class of graphs $\mathcal{H}$. Let $\alpha (G;\mathcal{H})$ denote the minimum value of the total sum of the sizes of subgraphs in $\mathcal{H}$ into which G can be decomposed, taken over all such decompositions of G.
openaire +2 more sources
Discrete Mathematics, Algorithms and Applications, 2015
Let k be a positive integer and G be a graph. If d(u) + d(v) ≥ 4k - 3 for any uv ∈ E(G), then G admits a star decomposition in which all stars have size at least k. In particular, every graph G with δ(G) ≥ 2k - 1 admits such a decomposition. The bounds are best possible, in the sense that there exist infinitely many graphs G with δ(G) ≥ 2k - 2 and ...
Yang Zhao, Baoyindureng Wu
openaire +2 more sources
Let k be a positive integer and G be a graph. If d(u) + d(v) ≥ 4k - 3 for any uv ∈ E(G), then G admits a star decomposition in which all stars have size at least k. In particular, every graph G with δ(G) ≥ 2k - 1 admits such a decomposition. The bounds are best possible, in the sense that there exist infinitely many graphs G with δ(G) ≥ 2k - 2 and ...
Yang Zhao, Baoyindureng Wu
openaire +2 more sources
Decompositions of graphs into trees
Journal of Graph Theory, 1989AbstractLet θ be a family of graphs. By a θ‐decomposition of a graph G we mean a partition λ of the edge set of G such that every F ϵ π spans in G a subgraph isomorphic to a graph in θ.In this paper we state the following conjecture: If T1 and T2 are two trees having relatively prime sizes then there exists c = c(T1 T2) such that every graph G ...
openaire +2 more sources
Graphs and Combinatorics, 1991
Proved are three theorems presenting upper and lower bounds of the minimum number of perfect subgraphs covering or partitioning either the vertex set or the edge set of a given graph. The weighted versions of both cases are studied, too. All the theorems are based on four lemmas, one of which being proved and published by the author in 1986.
openaire +2 more sources
Proved are three theorems presenting upper and lower bounds of the minimum number of perfect subgraphs covering or partitioning either the vertex set or the edge set of a given graph. The weighted versions of both cases are studied, too. All the theorems are based on four lemmas, one of which being proved and published by the author in 1986.
openaire +2 more sources
Heuristics for graph decomposition
ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445), 2002The problem addressed in this paper is that of decomposing a weighted graph into a specified number of subgraphs such that these subgraphs have balanced sums of vertex weights and minimal sums of edge weights. To find a reasonable solution to this intractable problem, we suggest an approximate objective function that can be minimized by heuristic ...
Hiba Tabbara, Tarek Dana, Nashat Mansour
openaire +1 more source