158 search results - page 3 / 32 » A Self-stabilizing Algorithm for Graph Searching in Trees |
WALCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
EACL
2009
ACL Anthology
14 years 7 months ago
2009
ACL Anthology
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
103
Voted
FCT
2003
Springer
15 years 2 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...