3204 search results - page 100 / 641 » The Alcuin Number of a Graph |
AE
2007
Springer
14 years 2 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
COCO
2007
Springer
14 years 2 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...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...
JCT
2008
13 years 8 months ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...