Search
ChatPaper
AI Writing
analysis
Analysis
编组
Open Data
more
More
RankingsMust ReadingJournal&ConferenceAI TRAI HistoryMaster Reading TreeXiaomai's Star TalentsTrajectoryTalentNDI TrackerOpenAI sign Language
VIPCreated with Sketch.

Generalized matroid matching.

András Recski,Jácint Szabó

Discrete Applied Mathematics（2020）

Cited 0|Views18
No score
Abstract
The matroid parity problem is known to be unsolvable in polynomial time in the general case and is polynomial for linearly represented matroids. Its generalization asks if there exists an independent set in a matroid, intersecting k-tuples in a given way. The known polynomial, non-polynomial and NP-hard special cases are summarized and some open cases are mentioned.
More
Translated text
Key words
Matroid,Matroid parity,Matroid matching
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined