Sciweavers

2354 search results - page 103 / 471
» Radio number for trees
Sort
View
ECAI
1998
Springer
15 years 10 months ago
Metaprogramming Forced Moves
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
Tristan Cazenave
DAM
2006
97views more  DAM 2006»
15 years 6 months ago
Fully dynamic recognition algorithm and certificate for directed cographs
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
Christophe Crespelle, Christophe Paul
WG
2004
Springer
15 years 11 months ago
Planar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
ACL
2012
13 years 8 months ago
MIX Is Not a Tree-Adjoining Language
The language MIX consists of all strings over the three-letter alphabet {a, b, c} that contain an equal number of occurrences of each letter. We prove Joshi’s (1985) conjecture ...
Makoto Kanazawa, Sylvain Salvati
AI
2010
Springer
15 years 6 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel