339 search results - page 16 / 68 » Geometry of Graphs |
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
COCOA
2008
Springer
13 years 8 months ago
2008
Springer
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...