39 search results - page 1 / 8 » Path-Based Supports for Hypergraphs |
IWOCA
2010
Springer
12 years 11 months ago
2010
Springer
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...
GD
2009
Springer
13 years 9 months ago
2009
Springer
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...
TAGT
1998
Springer
13 years 8 months ago
1998
Springer
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...
ERCIMDL
2003
Springer
13 years 9 months ago
2003
Springer
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...
APAQS
2001
IEEE
13 years 8 months ago
2001
IEEE
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...