On the Complexity of Matroid Isomorphism Problems
DOI10.1007/978-3-642-03351-3_27zbMATH Open1248.68260OpenAlexW1528879539MaRDI QIDQ3392964FDOQ3392964
Authors: Raghavendra Rao B. V., Jayalal Sarma M. N. 
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
Recommendations
- On the complexity of matroid isomorphism problem
- The complexity of the matroid homomorphism problem
- On the Complexity of Some Enumeration Problems for Matroids
- On the complexity of polytope isomorphism problems
- On the number of non-isomorphic matroids
- scientific article; zbMATH DE number 477971
- Query complexity of matroids
- scientific article; zbMATH DE number 512806
- The computational complexity of equivalence and isomorphism problems
- Matroid Complexity and Nonsuccinct Descriptions
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- On the Hardness of Graph Isomorphism
- Computational Complexity
- A Combinatorial Decomposition Theory
- Dividing a Graph into Triconnected Components
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- 2-Isomorphic Graphs
- Title not available (Why is that?)
- Logical Approaches to Computational Barriers
- Completeness results for graph isomorphism.
- Matroid Complexity and Nonsuccinct Descriptions
- Title not available (Why is that?)
- Vector representable matroids of given rank with given automorphism group
- Some hard problems on matroid spikes
- 3-connected Planar Graph Isomorphism is in Log-space
- On Whitney's 2‐isomorphism theorem for graphs
- On the complexity of matroid isomorphism problem
Cited In (7)
- On the Complexity of Some Enumeration Problems for Matroids
- On the complexity of polytope isomorphism problems
- The complexity of the matroid homomorphism problem
- Matroid Complexity and Nonsuccinct Descriptions
- Computation of lattice isomorphisms and the integral matrix similarity problem
- On the complexity of matroid isomorphism problem
- Determining when a graphic matroid is transversal in linear time
This page was built for publication: On the Complexity of Matroid Isomorphism Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392964)
