Generalized core maintenance of dynamic bipartite graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 176746
- Dynamic maintenance of directed hypergraphs
- Dynamic maintenance of planar digraphs, with applications
- scientific article; zbMATH DE number 1617249
- Maintaining chordal graphs dynamically: improved upper and lower bounds
- Dynamic maintenance of the transitive closure in disjunctive graphs
- scientific article; zbMATH DE number 1256640
- Fully dynamic biconnectivity in graphs
- Maintaining regular properties dynamically in k-terminal graphs
Cites work
Cited in
(7)- An order approach for the core maintenance problem on edge-weighted graphs
- Efficient temporal core maintenance of massive graphs
- Order based algorithms for the core maintenance problem on edge-weighted graphs
- Core decomposition, maintenance and applications
- Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs
- Network embedding for bipartite networks with applications in interlocking directorates in Chinese companies
- Dynamic maintenance of planar digraphs, with applications
This page was built for publication: Generalized core maintenance of dynamic bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832654)