1395 search results - page 65 / 279 » (k, )-Distance-Hereditary Graphs |
105
Voted
DAM
2008
15 years 3 months ago
2008
Given graphs G, G1, . . . , Gk, where k 2, the notation G (G1, G2, . . . , Gk) denotes that every factorization F1 F2
123
Voted
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
143
Voted
SPAA
2000
ACM
15 years 7 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
112
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
118
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...