228 search results - page 1 / 46 » Local Computations in Graphs: The Case of Cellular Edge Loca... |
FUIN
2006
13 years 4 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
ICIAP
1999
ACM
13 years 9 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
ADHOCNOW
2008
Springer
13 years 11 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
WDAG
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...