5889 search results - page 106 / 1178 » Graph Layout Problems |
153
click to vote
IPCO
2008
15 years 3 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
122
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
110
click to vote
AAAI
1990
15 years 3 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
127
Voted
COR
2006
15 years 2 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
125
click to vote
COMBINATORICA
2006
15 years 2 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...