2314 search results - page 184 / 463 » Minimal Partitions of a Graph |
154
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
117
click to vote
CSL
2008
Springer
15 years 4 months ago
2008
Springer
Tone-enhanced, generalized character posterior probability (GCPP), a generalized form of posterior probability at subword (Chinese character) level, is proposed as a rescoring met...
141
click to vote
AAAI
1996
15 years 5 months ago
1996
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
144
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
138
click to vote
COMBINATORICS
2007
15 years 4 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...