ON PRINCIPAL PARTITION OF MATROIDS WITH PARITY CONDITION INTO STRONGLY IRREDUCIBLE MINORS PAIRS.

Akira Onozawa, Masayuki Inoue, Shinichi Oishi, Kazuo Horiuchi

    Research output: Contribution to journalArticle

    Abstract

    The matroid parity problem is a common generalization of the matching problem for graphs. We defined the concept of principal partition of the central minor of a matroid with parity condition into strongly irreducible minors pairs and we showed some of its characteristics. Then we showed a class of matroids whose parity problem now became solvable by using the concept of these strongly irreducible minors pairs.

    Original languageEnglish
    Pages (from-to)10-19
    Number of pages10
    JournalElectronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)
    Volume68
    Issue number11
    Publication statusPublished - 1985 Nov

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    @article{2a92e01a63ba471a968259b77a0bdb21,
    title = "ON PRINCIPAL PARTITION OF MATROIDS WITH PARITY CONDITION INTO STRONGLY IRREDUCIBLE MINORS PAIRS.",
    abstract = "The matroid parity problem is a common generalization of the matching problem for graphs. We defined the concept of principal partition of the central minor of a matroid with parity condition into strongly irreducible minors pairs and we showed some of its characteristics. Then we showed a class of matroids whose parity problem now became solvable by using the concept of these strongly irreducible minors pairs.",
    author = "Akira Onozawa and Masayuki Inoue and Shinichi Oishi and Kazuo Horiuchi",
    year = "1985",
    month = "11",
    language = "English",
    volume = "68",
    pages = "10--19",
    journal = "Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)",
    issn = "8756-6621",
    publisher = "John Wiley and Sons Inc.",
    number = "11",

    }

    TY - JOUR

    T1 - ON PRINCIPAL PARTITION OF MATROIDS WITH PARITY CONDITION INTO STRONGLY IRREDUCIBLE MINORS PAIRS.

    AU - Onozawa, Akira

    AU - Inoue, Masayuki

    AU - Oishi, Shinichi

    AU - Horiuchi, Kazuo

    PY - 1985/11

    Y1 - 1985/11

    N2 - The matroid parity problem is a common generalization of the matching problem for graphs. We defined the concept of principal partition of the central minor of a matroid with parity condition into strongly irreducible minors pairs and we showed some of its characteristics. Then we showed a class of matroids whose parity problem now became solvable by using the concept of these strongly irreducible minors pairs.

    AB - The matroid parity problem is a common generalization of the matching problem for graphs. We defined the concept of principal partition of the central minor of a matroid with parity condition into strongly irreducible minors pairs and we showed some of its characteristics. Then we showed a class of matroids whose parity problem now became solvable by using the concept of these strongly irreducible minors pairs.

    UR - http://www.scopus.com/inward/record.url?scp=0022162193&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0022162193&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:0022162193

    VL - 68

    SP - 10

    EP - 19

    JO - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

    JF - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

    SN - 8756-6621

    IS - 11

    ER -