1545 search results - page 110 / 309 » On tree congestion of graphs |
150
click to vote
COCOON
2009
Springer
16 years 29 days ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
147
click to vote
INFOVIS
2005
IEEE
15 years 12 months ago
2005
IEEE
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
167
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
144
click to vote
IWOCA
2009
Springer
16 years 28 days ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
175
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...