REFINEMENT OF THE CONCEPT OF PRINCIPAL PARTITION FOR MATROID PARITY PROBLEM.

Akira Onozawa, Masayuki Inoue, Shin'ichi Oishi, Kazuo Horiuchi

研究成果: Conference article査読

抄録

The problem of finding the principal partition of a parity matroid is shown to be polynomially unsolvable in general. Two theorems are refined by using the concept of a minimal central minor: the first is the theorem on the existence of the principal partition; the second is the theorem on the characterization of the maximum independent parity set of a matroid with principal partition. A new polynomially solvable class of the parity problem is presented. Also, the weighted parity problem of a matroid with a principal partition is shown to be polynomially unsolvable in general. Finally, the concept of the principal partition for a parity matroid is generalized to a parity polymatroid.

本文言語English
ページ(範囲)815-818
ページ数4
ジャーナルProceedings - IEEE International Symposium on Circuits and Systems
出版ステータスPublished - 1985 12 1

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

引用スタイル