2612 search results - page 176 / 523 » Switching Graphs and Their Complexity |
227
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
In this demonstration, we present a database over complex documents, which, in addition to a structured text content, also has update information, annotations, and embedded object...
119
click to vote
ESA
2004
Springer
15 years 9 months 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 ...
108
click to vote
DAGSTUHL
2006
15 years 5 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...
130
click to vote
GG
2008
Springer
15 years 5 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...
110
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...