1206 search results - page 125 / 242 » Arc-Flags in Dynamic Graphs |
177
click to vote
COMGEO
2012
ACM
14 years 1 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
163
click to vote
VLDB
1993
ACM
15 years 10 months ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
235
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
232
click to vote
STRINGOLOGY
2008
15 years 7 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
151
click to vote
DM
2008
15 years 6 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...