154 search results - page 18 / 31 » algorithmica 2007 |
73
Voted
ALGORITHMICA
2007
14 years 9 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
ALGORITHMICA
2006
14 years 9 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
ALGORITHMICA
2006
14 years 9 months ago
2006
: We study the output-sensitive computations of all the combinations of the edges and vertices of a simple polygon P that allow a form closure grasp with less than four point conta...
ALGORITHMICA
2006
14 years 9 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
ALGORITHMICA
2006
14 years 9 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...