Sciweavers

IPPS
1999
IEEE
13 years 8 months ago
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
Michael Holzrichter, Suely Oliveira
COMPGEOM
2003
ACM
13 years 9 months ago
Morse-smale complexes for piecewise linear 3-manifolds
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
Herbert Edelsbrunner, John Harer, Vijay Natarajan,...
FOCS
2009
IEEE
13 years 10 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
ICCV
2005
IEEE
14 years 5 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas

Lecture Notes
673views
15 years 1 months ago
Combinatorial Algorithms
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
Jeff Erickson