Name
Abstract | ||
|---|---|---|
We propose an output-sensitive algorithm for the enumeration of all maximal bicliques in a bipartite graph, tailored to the case when the degree distribution in one partite set is very skewed. We accomplish a worst-case bound better than previously known general bounds if, e.g., the degree sequence follows a power law. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.ipl.2014.02.001 | Inf. Process. Lett. |
Keywords | Field | DocType |
degree sequence,power law,bipartite graph,degree distribution,partite set,favorable degree sequence,output-sensitive algorithm,general bound,maximal bicliques,analysis of algorithms | Complete bipartite graph,Automatic summarization,Discrete mathematics,Combinatorics,Analysis of algorithms,Enumeration,Bipartite graph,Degree distribution,Degree (graph theory),Graph enumeration,Mathematics | Journal |
Volume | Issue | ISSN |
114 | 6 | 0020-0190 |
Citations | PageRank | References |
2 | 0.37 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Damaschke | 1 | 471 | 56.99 |