Sciweavers

2294 search results - page 103 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
COMGEO
2010
ACM
14 years 10 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...
JGT
2010
93views more  JGT 2010»
14 years 8 months ago
An asymptotic version of a conjecture by Enomoto and Ota
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
Colton Magnant, Daniel M. Martin
DAM
2008
83views more  DAM 2008»
14 years 10 months ago
Spanning forests and the golden ratio
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
Pavel Chebotarev
WETICE
1996
IEEE
15 years 2 months ago
Educational applications of multi-client synchronization through improved Web graph semantics
The Multi-Head, Multi-Tail, Multi-Client (MMM) Browsing Project is a continuing effort to bring stronger graph semantics to the World Wide Web thereby increasing the Web's us...
Michael V. Capps, Brian C. Ladd, P. David Stotts, ...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 2 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...