6740 search results - page 95 / 1348 » An s -Hamiltonian Line Graph Problem |
DAM
2008
13 years 10 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
IPCO
2008
13 years 11 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...
SODA
2010
ACM
14 years 7 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...
AAAI
1990
13 years 11 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...