5473 search results - page 159 / 1095 » On the graph isomorphism problem |
159
click to vote
CSCLP
2005
Springer
16 years 17 days ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
180
Voted
DAM
2006
15 years 7 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
153
Voted
FMSD
2007
15 years 7 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
237
Voted
DISOPT
2011
14 years 10 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
190
Voted
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...