Sciweavers

4066 search results - page 47 / 814
» Improved Algorithms and Analysis for Secretary Problems and ...
Sort
View
125
Voted
CAV
2006
Springer
110views Hardware» more  CAV 2006»
15 years 7 months ago
Improving Pushdown System Model Checking
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
Akash Lal, Thomas W. Reps
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 8 months ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...
COMPGEOM
2010
ACM
15 years 9 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
ICFP
2006
ACM
16 years 4 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
TCBB
2008
101views more  TCBB 2008»
15 years 4 months ago
Improved Layout of Phylogenetic Networks
Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal-angle algorithm is used to draw such networks, producing layouts that leave much room f...
Philippe Gambette, Daniel H. Huson