3204 search results - page 61 / 641 » The Alcuin Number of a Graph |
GD
2005
Springer
14 years 1 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
DM
2008
13 years 7 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
DSD
2003
IEEE
14 years 1 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...