6740 search results - page 156 / 1348 » An s -Hamiltonian Line Graph Problem |
126
click to vote
IFL
1997
Springer
15 years 7 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
123
click to vote
AAAI
2008
15 years 5 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...
103
click to vote
AIPS
2008
15 years 5 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...
110
Voted
ESA
2010
Springer
15 years 4 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
109
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...