Sciweavers

643 search results - page 61 / 129
» Supereulerian planar graphs
Sort
View
FCT
2009
Springer
14 years 1 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
14 years 4 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw
IJCNN
2007
IEEE
14 years 4 months ago
3D-SE Viewer: A Text Mining Tool based on Bipartite Graph Visualization
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
Shiro Usui, Antoine Naud, Naonori Ueda, Tatsuki Ta...
ICALP
2004
Springer
14 years 3 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 9 months ago
On Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
Iyad A. Kanj, Ljubomir Perkovic