New results on induced matchings

Martin Charles Golumbic; Moshe Lewenstein

doi:10.1016/S0166-218X(99)00194-8

New results on induced matchings

Martin Charles Golumbic, Moshe Lewenstein

Research output: Contribution to journal › Article › peer-review

Abstract

A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-Complete in general and specifically for bipartite graphs and for 3-regular planar graphs. The problem has been shown to be polynomial for several classes of graphs. In this paper we generalize the results to wider classes of graphs, and improve the time complexity of previously known results.

Original language	English
Pages (from-to)	157-165
Number of pages	9
Journal	Discrete Applied Mathematics
Volume	101
Issue number	1-3
DOIs	https://doi.org/10.1016/S0166-218X(99)00194-8
State	Published - 15 Apr 2000
Externally published	Yes

Keywords

Design and analysis of algorithms
Graph theory
Induced matchings
Matchings
Perfect graphs
Strong matchings

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S0166-218X(99)00194-8

Cite this

@article{8fb956663b6442ebb4fd15fe9587299f,

title = "New results on induced matchings",

abstract = "A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-Complete in general and specifically for bipartite graphs and for 3-regular planar graphs. The problem has been shown to be polynomial for several classes of graphs. In this paper we generalize the results to wider classes of graphs, and improve the time complexity of previously known results.",

keywords = "Design and analysis of algorithms, Graph theory, Induced matchings, Matchings, Perfect graphs, Strong matchings",

author = "Golumbic, {Martin Charles} and Moshe Lewenstein",

year = "2000",

month = apr,

day = "15",

doi = "10.1016/S0166-218X(99)00194-8",

language = "English",

volume = "101",

pages = "157--165",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - New results on induced matchings

AU - Golumbic, Martin Charles

AU - Lewenstein, Moshe

PY - 2000/4/15

Y1 - 2000/4/15

N2 - A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-Complete in general and specifically for bipartite graphs and for 3-regular planar graphs. The problem has been shown to be polynomial for several classes of graphs. In this paper we generalize the results to wider classes of graphs, and improve the time complexity of previously known results.

AB - A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-Complete in general and specifically for bipartite graphs and for 3-regular planar graphs. The problem has been shown to be polynomial for several classes of graphs. In this paper we generalize the results to wider classes of graphs, and improve the time complexity of previously known results.

KW - Design and analysis of algorithms

KW - Graph theory

KW - Induced matchings

KW - Matchings

KW - Perfect graphs

KW - Strong matchings

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

U2 - 10.1016/S0166-218X(99)00194-8

DO - 10.1016/S0166-218X(99)00194-8

M3 - Article

AN - SCOPUS:0000369268

SN - 0166-218X

VL - 101

SP - 157

EP - 165

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-3

ER -

New results on induced matchings

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this