3211 search results - page 197 / 643 » On the Grundy Number of a Graph |
151
click to vote
FEGC
2009
15 years 4 months ago
2009
We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of ...
189
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
180
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
177
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
171
click to vote
COMPGEOM
2006
ACM
16 years 14 days ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...