9532 search results - page 237 / 1907 » Logic, Graphs, and Algorithms |
143
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
148
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
176
click to vote
TCS
2008
15 years 5 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
171
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
167
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...