Abstract
In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O( n). We described a linear time algorithm to list such subgraphs. The arboricity bound is necessary: for any constant k and any n there exists an n-vertex graph with O( n) edges and ( n log n) k maximal complete bipartite subgraphs K k, l .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have