1986 search results - page 19 / 398 » Path Separability of Graphs |
202
click to vote
TAOSD
2010
15 years 4 months ago
2010
Abstract. Aspect Oriented Modeling (AOM) techniques facilitate separate modeling of concerns and allow for a more flexible composition of these than traditional modeling technique...
184
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
168
click to vote
MDM
2009
Springer
16 years 12 days ago
2009
Springer
While wireless sensor networks (WSNs) are typically targeted at large-scale deployment, due to many practical or inevitable reasons, a WSN may not always remain connected. In this...
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
149
click to vote
WADS
2007
Springer
15 years 12 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...