5473 search results - page 87 / 1095 » On the graph isomorphism problem |
COCO
2007
Springer
15 years 6 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...
116
click to vote
ICPADS
2007
IEEE
15 years 6 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
14 years 12 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
GC
2007
Springer
14 years 12 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...
101
click to vote
PPAM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...