Open dc979ce0-b8e8-485c-a50f-8cf6079a5d30 opened 10 years ago
New commits:
da0a0f6 | Added (not yet finished) method _has_binary_minor() to BinaryMatroid class. |
Commit: da0a0f6
Branch: u/Jayant/ticket/16545
Branch pushed to git repo; I updated commit sha1. New commits:
57ab8c9 | Added _fundamental_graph() procedure to BinaryMatroid class |
Branch pushed to git repo; I updated commit sha1. New commits:
0e02270 | Added initialization of permutation matrices based on degrees. |
Branch pushed to git repo; I updated commit sha1. New commits:
320479c | Added new functions tp repminor_helpers.pyx including prune() and recurse() (not completely finished). |
Branch pushed to git repo; I updated commit sha1. New commits:
0fd0410 | Added induced subgarph isomorphism check amound other things. |
Branch pushed to git repo; I updated commit sha1. New commits:
264a347 | Finished putting together Ullman's algorithm implementation. Testing, profiling, documentation and compliance to follow. |
Branch pushed to git repo; I updated commit sha1. New commits:
d089571 | Fixed the bug in pruning. |
Branch pushed to git repo; I updated commit sha1. New commits:
9458a50 | Modified code to deal only with simple matroids and then check if parallel classes find mappings(Still some bugs left). Turned off profiling in lean_matrix.pyx. |
Branch pushed to git repo; I updated commit sha1. New commits:
76c5308 | Fixed bugs and tested correctness with random tests. ToDo: Profile and add more static typing if needed. |
Branch pushed to git repo; I updated commit sha1. New commits:
c55d09a | Added functionality to test induced subgraph isomorphism for only the unique reduced representations of simple matroid corresponding to ``self``(Exploits symmetry in a sense). |
Branch pushed to git repo; I updated commit sha1. New commits:
1ff2155 | repminor_helpers extension is now pep8 compliant. |
Changed branch from u/Jayant/ticket/16545 to u/Stefan/ticket/16545
I rebased the code on 6.5.beta1; no further changes.
Last 10 new commits:
33f83df | Finished putting together Ullman's algorithm implementation. Testing, profiling, documentation and compliance to follow. |
969e90f | Fixed the bug in pruning. |
2c8e74b | Modified code to deal only with simple matroids and then check if parallel classes find mappings(Still some bugs left). Turned off profiling in lean_matrix.pyx. |
bdd95a0 | Fixed bugs and tested correctness with random tests. ToDo: Profile and add more static typing if needed. |
ec57474 | Added functionality to test induced subgraph isomorphism for only the unique reduced representations of simple matroid corresponding to ``self``(Exploits symmetry in a sense). |
baa7769 | repminor_helpers extension is now pep8 compliant. |
5ce33dd | Added some documentation to repminor_helpers extension |
801c187 | Added documentation (except examples) to repminor_helpers extension. Added repminor_helpers to sage.matroids.advanced.py. |
ea0d925 | Switching branch. |
34a5ca0 | Added examples. Passing doctests for both linear_matroid.pyx and repminor_helpers.pyx. |
Branch pushed to git repo; I updated commit sha1. New commits:
0abf885 | Fixed bitset include path |
Doesn't merge with current version; doctest coverage is lacking.
Use pattern matching inspired by Hliněný's MACEK to test if a binary matroid has another binary matroid as a minor. Given a binary matroid, for each basis one can produce a matrix representation. We then look for a deletion set, a contraction set and a row-column permutation that yields a submatrix same as the representation of the given minor to be tested.
CC: @sagetrac-Stefan @sagetrac-Rudi
Component: matroid theory
Keywords: binary matroid, minor
Author: Jayant
Branch/Commit: u/Stefan/ticket/16545 @
0abf885
Issue created by migration from https://trac.sagemath.org/ticket/16545