736 search results - page 14 / 148 » Distinguishing geometric graphs |
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show h...
115
click to vote
CCCG
2010
15 years 1 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
103
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
JMLR
2006
14 years 11 months ago
2006
This paper deals with chain graph models under alternative AMP interpretation. A new representative of an AMP Markov equivalence class, called the largest deflagged graph, is prop...