3204 search results - page 40 / 641 » The Alcuin Number of a Graph |
COMBINATORICS
2000
13 years 7 months ago
2000
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
DAM
2002
13 years 7 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
SIAMCOMP
2008
13 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
WG
2010
Springer
13 years 6 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...