9532 search results - page 250 / 1907 » Logic, Graphs, and Algorithms |
169
click to vote
AAIM
2007
Springer
16 years 9 days ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
149
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
188
click to vote
FUIN
2007
15 years 6 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
162
click to vote
SIMPRA
2008
15 years 5 months ago
2008
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
146
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...