An enumerative perspective on connectivity

DOI10.46298/THEORETICS.24.26MaRDI QIDQ7035788zbMATH OpenFDO

Authors Shyan S. Akmal

Publication date 29 January 2025

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

rankformal power seriesconnectivitymaximum flowalgebraic graph algorithmsall-pairs flow

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Flows in graphs (05C21) Enumeration in graph theory (05C30) Connectivity (05C40) Parallel algorithms in computer science (68W10)

This page was built for publication: An enumerative perspective on connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7035788)