2125 search results - page 42 / 425 » On Graph Complexity |
137
click to vote
AIPS
2008
15 years 8 months ago
2008
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
155
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
173
Voted
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
162
click to vote
COCOA
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
163
click to vote
AAAI
2008
15 years 8 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...