Algebraic Graph Algorithms

DOI10.1007/978-3-540-85238-4_5MaRDI QIDQ3599116zbMATH OpenOpenAlexFDO

Authors Piotr Sankowski

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85238-4_5

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• Algebraic algorithms for matching and matroid problems
• An algebraic matching algorithm
• Faster dynamic matchings and vertex connectivity
• Maximum weight bipartite matching in matrix multiplication time
• Algebraic algorithms for linear matroid parity problems

Cited in

(11)

• Multiaspect graphs: algebraic representation and algorithms
• scientific article; zbMATH DE number 4185659 (Why is no real title available?)
• Algebraic algorithms for matching and matroid problems
• scientific article; zbMATH DE number 3978423 (Why is no real title available?)
• Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
• Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
• Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
• Dynamic matrix rank
• scientific article; zbMATH DE number 3989401 (Why is no real title available?)
• Algebraic Elements of Graphs
• scientific article; zbMATH DE number 3974995 (Why is no real title available?)

This page was built for publication: Algebraic Graph Algorithms

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