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

Full work available at URL https://doi.org/10.46298/THEORETICS.24.26

zbMATH Keywords

algebraic graph algorithmsall-pairs flowconnectivityformal power seriesmaximum flowrank

Mathematics Subject Classification ID

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

Cites work

• A combinatorial approach to matrix algebra
• A generalization of the fast LUP matrix decomposition algorithm and applications
• An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
• An enumerative perspective on connectivity
• Breaking the cubic barrier for all-pairs max-flow: Gomory-Hu tree in nearly quadratic time
• Determinantal sieving
• Determinants from homomorphisms
• Faster algorithms for all-pairs bounded min-cuts
• Graph connectivities, network coding, and expander graphs
• scientific article; zbMATH DE number 1332669 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Improved Merlin-Arthur protocols for central problems in fine-grained complexity
• New bounds for matrix multiplication: from alpha to omega
• On the complexity of fixed parameter clique and dominating set
• Proofs from THE BOOK. Including illustrations by Karl H. Hofmann
• Tight conditional lower bounds for vertex connectivity problems

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)