Sciweavers

505 search results - page 4 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
DAM
2006
88views more  DAM 2006»
14 years 9 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
ICALP
2000
Springer
15 years 1 months ago
Formalizing the Development of Agent-Based Systems Using Graph Processes
Graph processes are used in order to formalize the relation between global requirement specifications of multi-agent systems by means of message sequence charts, and implementatio...
Ralph Depke, Reiko Heckel
JAL
2006
114views more  JAL 2006»
14 years 9 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
CCCG
2007
14 years 11 months ago
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
Nadia Benbernou, Erik D. Demaine, Martin L. Demain...
VL
1999
IEEE
142views Visual Languages» more  VL 1999»
15 years 1 months ago
Visual Graphs
The formal treatment of visual languages is often based on graph representations. Since the matter of discourse is visual languages, it would be convenient if the formal manipulat...
Martin Erwig