6740 search results - page 83 / 1348 » An s -Hamiltonian Line Graph Problem |
PPSN
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
COCO
2007
Springer
14 years 4 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
ICPADS
2007
IEEE
14 years 4 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
ENDM
2007
13 years 10 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
GC
2007
Springer
13 years 10 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...