5473 search results - page 198 / 1095 » On the graph isomorphism problem |
140
click to vote
SWAT
1992
Springer
15 years 11 months ago
1992
Springer
We obtain the rst NC algorithm for the low-diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5 (n)) time, and uses O(n2) processors.
149
click to vote
APPML
2008
15 years 7 months ago
2008
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimiz...
183
click to vote
ECCC
2007
15 years 7 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
182
click to vote
COMBINATORICS
2002
15 years 7 months ago
2002
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
186
click to vote
ECCC
2000
15 years 7 months ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...