Sciweavers

56 search results - page 5 / 12
» Holes in Graphs
Sort
View
ALGORITHMICA
2007
165views more  ALGORITHMICA 2007»
14 years 12 months ago
Motorcycle Graphs and Straight Skeletons
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
Siu-Wing Cheng, Antoine Vigneron
TVCG
2008
110views more  TVCG 2008»
14 years 11 months ago
Visibility-driven Mesh Analysis and Visualization through Graph Cuts
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
Kaichi Zhou, Eugene Zhang, Jirí Bittner, Pe...
JCT
2002
93views more  JCT 2002»
14 years 11 months ago
Coloring Locally Bipartite Graphs on Surfaces
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
Bojan Mohar, Paul D. Seymour
IANDC
2008
141views more  IANDC 2008»
14 years 12 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
ENTCS
2006
135views more  ENTCS 2006»
14 years 11 months ago
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
Don Syme