9532 search results - page 225 / 1907 » Logic, Graphs, and Algorithms |
173
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to express quantitative timing aspects. Tab...
176
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
155
click to vote
WG
2007
Springer
16 years 2 days ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
168
click to vote
CIAC
1997
Springer
15 years 10 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
151
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...