6740 search results - page 269 / 1348 » An s -Hamiltonian Line Graph Problem |
100
Voted
APPML
2008
15 years 3 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...
114
Voted
ECCC
2007
15 years 3 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...
128
Voted
COMBINATORICS
2002
15 years 3 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,...
128
Voted
ECCC
2000
15 years 3 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 ...
150
Voted
COLOGNETWENTE
2010
15 years 2 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...