251 search results - page 20 / 51 » Constructive Linear Time Algorithms for Branchwidth |
112
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
143
click to vote
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
167
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
147
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We propose a new algorithm for constructing finite-element meshes suitable for spacetime discontinuous Galerkin solutions of linear hyperbolic PDEs. Given a triangular mesh of som...
150
click to vote
ISPD
2006
ACM
15 years 10 months ago
2006
ACM
Linear programming (LP) based methods are attractive for solving the placement problem because of their ability to model Half-Perimeter Wirelength (HPWL) and timing. However, it h...