3.8 Proceedings Paper

Minimum Maximal Acyclic Matching in Proper Interval Graphs

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

On the complexity of minimum maximal uniquely restricted matching

Juhi Chaudhary et al.

Summary: The paper examines the complexity of the MIN-MAX-UR MATCHING problem in different types of graphs. It is found that the problem is NP-complete for certain types of graphs, but polynomial time solvable for others. Additionally, further complexity results are proven for specific types of graphs.

THEORETICAL COMPUTER SCIENCE (2021)

Article Computer Science, Theory & Methods

The many facets of upper domination

Cristina Bazgan et al.

THEORETICAL COMPUTER SCIENCE (2018)

Article Mathematics, Applied

On the MAX MIN VERTEX COVER problem

Nicolas Boria et al.

DISCRETE APPLIED MATHEMATICS (2015)

Article Operations Research & Management Science

Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover

Peter Damaschke

DISCRETE OPTIMIZATION (2011)

Article Operations Research & Management Science

Approximability results for the maximum and minimum maximal induced matching problems

Yury Orlovich et al.

DISCRETE OPTIMIZATION (2008)

Article Mathematics

Generalized subgraph-restricted matchings in graphs

W Goddard et al.

DISCRETE MATHEMATICS (2005)

Article Computer Science, Information Systems

A linear time recognition algorithm for proper interval graphs

BS Panda et al.

INFORMATION PROCESSING LETTERS (2003)