112 search results - page 4 / 23 » Improved algorithms for hypergraph bipartitioning |
WG
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
SODA
2010
ACM
15 years 7 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...
JGAA
2006
14 years 9 months ago
2006
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...