𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An exact exponential time algorithm for counting bipartite cliques

✍ Scribed by Konstantin Kutzkov

Book ID
113663363
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
152 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Exact Algorithm for Constra
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
✍ Henning Fernau; Rolf Niedermeier πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 382 KB

The constraint bipartite vertex cover problem (CBVC for short) is as follows: given a bipartite graph G with n vertices and two positive integers k 1 k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It fo

An exact algorithm for a core/periphery
An exact algorithm for a core/periphery bipartitioning problem
✍ Michael Brusco πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 427 KB

The discrete optimization problem associated with partitioning a set of actors into core and periphery subsets has typically been approached using approximate procedures such as exchange heuristics, genetic algorithms, and simulated annealing. Although these procedures are effective and scalable for