Sciweavers

1402 search results - page 7 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
IPL
2010
79views more  IPL 2010»
13 years 8 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette
DM
2008
62views more  DM 2008»
13 years 9 months ago
Classification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
Jan Degraer, Kris Coolsaet
COLT
1993
Springer
14 years 1 months ago
Piecemeal Learning of an Unknown Environment
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
Margrit Betke, Ronald L. Rivest, Mona Singh
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 9 months ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 7 months ago
Approximation Algorithms for Domination Search
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...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...