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...
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...
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...
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...
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...