4865 search results - page 400 / 973 » The Complexity of Graph Connectivity |
161
click to vote
ESA
2004
Springer
16 years 6 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
144
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
178
click to vote
GG
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
205
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
169
click to vote
ACSAC
2003
IEEE
16 years 4 days ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...