Sciweavers

641 search results - page 100 / 129
» On Planar Quasi-Parity Graphs
Sort
View
COMGEO
2007
ACM
14 years 10 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood
ECCC
2010
143views more  ECCC 2010»
14 years 7 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
TIP
2008
124views more  TIP 2008»
14 years 9 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...
JCT
2008
59views more  JCT 2008»
14 years 9 months ago
The Jones polynomial and graphs on surfaces
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the li...
Oliver T. Dasbach, David Futer, Efstratia Kalfagia...
COMGEO
2012
ACM
13 years 5 months ago
Point-set embeddings of plane 3-trees
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...