1545 search results - page 30 / 309 » On tree congestion of graphs |
COMGEO
2007
ACM
14 years 9 months ago
2007
ACM
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
IDEAS
2005
IEEE
15 years 3 months ago
2005
IEEE
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
105
click to vote
ICPADS
2007
IEEE
15 years 4 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
ALGORITHMICA
2010
14 years 10 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
WG
2004
Springer
15 years 3 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...