Sciweavers

Share
39 search results - page 1 / 8
» Path-Based Supports for Hypergraphs
Sort
View
IWOCA
2010
Springer
240views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Path-Based Supports for Hypergraphs
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, A...
GD
2009
Springer
11 years 6 months ago
On Planar Supports for Hypergraphs
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Be...
TAGT
1998
Springer
162views Graph Theory» more  TAGT 1998»
11 years 5 months ago
Hypergraphs as a Uniform Diagram Representation Model
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
Mark Minas
ERCIMDL
2003
Springer
116views Education» more  ERCIMDL 2003»
11 years 6 months ago
Connecting Interface Metaphors to Support Creation of Path-Based Collections
Abstract. Walden’s Paths is a suite of tools that supports the creation and presentation of linear hypermedia paths—targeted collections that enable authors to reorganize and c...
Unmil Karadkar, Andruid Kerne, Richard Furuta, Lui...
APAQS
2001
IEEE
11 years 5 months ago
A Path-Based Approach to the Detection of Infinite Looping
Infinite looping is a common type of program error. This paper studies the detection of infinite loops in imperative programs. A sufficient condition is given, which is based on p...
Jian Zhang
books