Efficient enumeration of bipartite subgraphs in graphs

DOI10.1007/978-3-319-94776-1_38OpenAlexW3105005952MaRDI QIDQ1791004

Takeaki Uno, Kunihiro Wasa

Publication date: 4 October 2018

Full work available at URL: https://arxiv.org/abs/1803.03839

zbMATH Keywords

bipartite graphsdegeneracygraph algorithmssubgraph enumerationconstant delaybinary partition method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Proximity Search for Maximal Subgraph Enumeration ⋮ Constant amortized time enumeration of Eulerian trails ⋮ Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes ⋮ Unnamed Item ⋮ A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

This page was built for publication: Efficient enumeration of bipartite subgraphs in graphs