402 search results - page 6 / 81 » On Finding the Number of Graph Automorphisms |
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
106
click to vote
CPC
2004
14 years 11 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
112
click to vote
DM
2006
14 years 11 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...