3267 search results - page 162 / 654 » Generalized quasirandom graphs |
123
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
137
Voted
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
138
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
122
click to vote
ECAL
2003
Springer
15 years 10 months ago
2003
Springer
We present a general method for evaluating and visualizing evolutionary dynamics of self-replicators using a graph-based representation for genealogy. Through a transformation from...
131
click to vote
COMPGEOM
1993
ACM
15 years 8 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...