On the Complexity of Matroid Isomorphism Problems

DOI10.1007/978-3-642-03351-3_27zbMath1248.68260OpenAlexW1528879539MaRDI QIDQ3392964

Raghavendra Rao B. V., M. N. Jayalal Sarma

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of matroid isomorphism problem
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Vector representable matroids of given rank with given automorphism group
• Completeness results for graph isomorphism.
• Some hard problems on matroid spikes
• Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
• 3-connected Planar Graph Isomorphism is in Log-space
• Matroid Complexity and Nonsuccinct Descriptions
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• A Combinatorial Decomposition Theory
• On Whitney's 2‐isomorphism theorem for graphs
• On the Hardness of Graph Isomorphism
• 2-Isomorphic Graphs
• Dividing a Graph into Triconnected Components
• Logical Approaches to Computational Barriers
• Computational Complexity

This page was built for publication: On the Complexity of Matroid Isomorphism Problems