785 search results - page 5 / 157 » Embedding a Forest in a Graph |
GECCO
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
CIAC
2010
Springer
14 years 5 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
DMTCS
2010
13 years 5 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
DAM
2000
13 years 7 months ago
2000
IPPS
1998
IEEE
14 years 12 hour ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...