Arboricity and bipartite subgraph listing algorithms
From MaRDI portal
Recommendations
Cites work
- Algorithmic Aspects of Vertex Elimination on Graphs
- Arboricity and Subgraph Listing Algorithms
- Can visibility graphs be represented compactly?
- Connectivity, graph minors, and subgraph multiplicity
- Edge-Disjoint Spanning Trees of Finite Graphs
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 64170 (Why is no real title available?)
- Pattern associativity and the retrieval of semantic networks
- Planar orientations with low out-degree and compaction of adjacency matrices
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(32)- Efficient enumeration of maximal induced bicliques
- Faster algorithms for counting subgraphs in sparse graphs
- An algebraic semigroup method for discovering maximal frequent itemsets
- On computing the Galois lattice of bipartite distance hereditary graphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Scale reduction techniques for computing maximum induced bicliques
- Counting subgraphs in relational event graphs
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- A constructive arboricity approximation scheme
- Algorithms on Subtree Filament Graphs
- Arboricity and Subgraph Listing Algorithms
- On the number of maximal bipartite subgraphs of a graph
- Problems and invariants connected with bicliques and multicliques of graphs
- Bi‐arc graphs and the complexity of list homomorphisms
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Fully dynamic arboricity maintenance
- On the generation of bicliques of a graph
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- Computing dense and sparse subgraphs of weakly closed graphs
- On linear algebraic algorithms for the subgraph matching problem and its variants
- Finding small complete subgraphs efficiently
- Compact labelings for efficient first-order model-checking
- Subgraph enumeration in optimal I/O complexity
- On the incidence matrix of a graph with matrix weights
- Structural parameterizations of the biclique-free vertex deletion problem
- Consensus algorithms for the generation of all maximal bicliques
- A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Efficient enumeration of k-plexes and k-defective cliques
- Subgraph counting in subquadratic time for bounded degeneracy graphs
- Ramified rectilinear polygons: coordinatization by dendrons
- An approximation ratio for biclustering
This page was built for publication: Arboricity and bipartite subgraph listing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334644)