169 search results - page 9 / 34 » arcs 2007 |
IPL
2007
13 years 7 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
IJCAI
2007
13 years 9 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
WG
2007
Springer
14 years 1 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
IPL
2007
13 years 7 months ago
2007
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...