5100 search results - page 235 / 1020 » The Linear Complexity of a Graph |
110
click to vote
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
127
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
109
click to vote
WG
1993
Springer
15 years 4 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
101
click to vote
ENTCS
2007
15 years 17 days ago
2007
Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Par...
111
click to vote
ICCV
2005
IEEE
16 years 2 months ago
2005
IEEE
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 ...