Improvement of Upper Bound of Minimum Maximal Matching in Subcubic Graphs

Advances in Applied Mathematics ◽

10.12677/aam.2021.1010368 ◽

2021 ◽

Vol 10 (10) ◽

pp. 3487-3494

Author(s):

晴夏

Keyword(s):

Upper Bound ◽

Maximal Matching ◽

Minimum Maximal Matching ◽

Subcubic Graphs

Download Full-text

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem

Information Processing Letters ◽

10.1016/j.ipl.2011.02.006 ◽

2011 ◽

Vol 111 (10) ◽

pp. 465-468 ◽

Author(s):

Yusuke Matsumoto ◽

Naoyuki Kamiyama ◽

Keiko Imai

Keyword(s):

Approximation Algorithm ◽

Edge Coloring ◽

Matching Problem ◽

Maximal Matching ◽

Coloring Number ◽

Minimum Maximal Matching

Download Full-text

Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-92702-8_4 ◽

2021 ◽

pp. 48-64

Author(s):

Szymon Dudycz ◽

Pasin Manurangsi ◽

Jan Marcinkowski

Keyword(s):

Bipartite Graphs ◽

Maximal Matching ◽

Minimum Maximal Matching

Download Full-text

An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs

SIAM Journal on Discrete Mathematics ◽

10.1137/120900678 ◽

2014 ◽

Vol 28 (3) ◽

pp. 1102-1136 ◽

Author(s):

Chun-Hung Liu

Keyword(s):

Chromatic Number ◽

Upper Bound ◽

Fractional Chromatic Number ◽

Subcubic Graphs

Download Full-text

Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-540-79228-4_32 ◽

2008 ◽

pp. 364-374 ◽

Author(s):

M. Demange ◽

T. Ekim

Keyword(s):

Bipartite Graphs ◽

Np Hard ◽

Maximal Matching ◽

Minimum Maximal Matching

Download Full-text

Minimum-maximal matching in series-parallel graphs

European Journal of Operational Research ◽

10.1016/0377-2217(88)90258-5 ◽

1988 ◽

Vol 33 (1) ◽

pp. 98-105 ◽

Author(s):

M.B. Richey ◽

R.Gary Parker

Keyword(s):

Maximal Matching ◽

In Series ◽

Minimum Maximal Matching

Download Full-text

A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_21 ◽

2009 ◽

pp. 267-278 ◽

Author(s):

Zvi Gotthilf ◽

Moshe Lewenstein ◽

Elad Rainshmidt

Keyword(s):

Approximation Algorithm ◽

Matching Problem ◽

Maximal Matching ◽

Minimum Maximal Matching

Download Full-text

Tight Approximation Ratio for Minimum Maximal Matching

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-17953-3_14 ◽

2019 ◽

pp. 181-193 ◽

Author(s):

Szymon Dudycz ◽

Mateusz Lewandowski ◽

Jan Marcinkowski

Keyword(s):

Approximation Ratio ◽

Maximal Matching ◽

Minimum Maximal Matching

Download Full-text

Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_43 ◽

2003 ◽

pp. 415-424 ◽

Author(s):

Miroslav Chlebík ◽

Janka Chlebíková

Keyword(s):

Dominating Set ◽

Maximal Matching ◽

Edge Dominating Set ◽

Approximation Hardness ◽

Minimum Maximal Matching

Download Full-text

The proof of the upper bound in the multifractal formalism for chirps

Journal of Approximation Theory ◽

10.1016/s0021-9045(03)00010-8 ◽

2004 ◽

Vol 130 (2) ◽

pp. 99-110

Author(s):

M BENSLIMANE

Keyword(s):

Upper Bound ◽

Multifractal Formalism

Download Full-text

The spatial oscillation of velocity fields in the roll bite of strip cold rolling by the upper bound approach

Revue de Métallurgie ◽

10.1051/metal/2012003 ◽

2012 ◽

Vol 109 (2) ◽

pp. 73-80

Author(s):

Q.-T. Ngo ◽

A. Ehrlacher ◽

N. Legrand

Keyword(s):

Cold Rolling ◽

Upper Bound ◽

Velocity Fields ◽

Spatial Oscillation ◽

Download Full-text