2398 search results - page 75 / 480 » Constraint Programming and Graph Algorithms |
135
click to vote
ESA
1998
Springer
15 years 9 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
134
click to vote
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
131
click to vote
ICML
2010
IEEE
15 years 5 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...
207
click to vote
OOPSLA
2000
Springer
15 years 8 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
124
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...