9532 search results - page 145 / 1907 » Logic, Graphs, and Algorithms |
109
click to vote
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
WG
2009
Springer
15 years 6 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
WEA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
FLAIRS
2004
15 years 23 days ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...