Constant-Time Algorithms for Sparsity Matroids

DOI10.1007/978-3-642-31594-7_42zbMath1271.05094OpenAlexW1504952479MaRDI QIDQ2843275

Shin-ichi Tanigawa, Hiro Ito, Yuichi Yoshida

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_42

zbMATH Keywords

testerrigidityconnectivitysparse graphsspanning treesindependent sets of a matroidsparsity matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Testing the supermodular-cut condition

This page was built for publication: Constant-Time Algorithms for Sparsity Matroids