2487 search results - page 211 / 498 » Partitions of Graphs into Trees |
IPL
2006
15 years 3 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
351
click to vote
IWOCA
2010
Springer
14 years 10 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
120
click to vote
SIAMDM
2008
15 years 3 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
115
Voted
DCC
2000
IEEE
15 years 8 months ago
2000
IEEE
We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of...
144
Voted
ICWS
2010
IEEE
15 years 5 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...