An exact exponential time algorithm for counting bipartite cliques
Copyright policy )An exact exponential time algorithm for counting bipartite cliques
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- IT University of Copenhagen Denmark
- University of Copenhagen Denmark
Exact exponential time algorithms, Counting bipartite cliques, Enumeration in graph theory, 004, analysis of algorithms, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Analysis of algorithms, counting bipartite cliques, exact exponential time algorithms
Exact exponential time algorithms, Counting bipartite cliques, Enumeration in graph theory, 004, analysis of algorithms, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Analysis of algorithms, counting bipartite cliques, exact exponential time algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!