8728 search results - page 433 / 1746 » On Reduct Construction Algorithms |
190
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
186
click to vote
EVOW
2006
Springer
15 years 11 months ago
2006
Springer
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems...
200
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
176
click to vote
ICALP
1995
Springer
15 years 11 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
198
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...