Sciweavers

704 search results - page 24 / 141
» Isometrically Embedded Graphs
Sort
View
CODES
2000
IEEE
15 years 4 months ago
Heterogeneous modeling and simulation of embedded systems in El Greco
This paper describes the functional specification and verification portions of El Greco, a system for high-level, heterogeneous functional specification, efficient compiled si...
Joseph Buck, Radha Vaidyanathan
ECCC
2010
143views more  ECCC 2010»
14 years 9 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
JGT
2008
74views more  JGT 2008»
14 years 11 months ago
Straight line embeddings of cubic planar graphs with integer edge lengths
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length.
Jim Geelen, Anjie Guo, David McKinnon
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 11 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
ESA
2005
Springer
95views Algorithms» more  ESA 2005»
15 years 5 months ago
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
Sergio Cabello, Bojan Mohar