Acyclic matching in some subclasses of graphs

A subset M⊆E of edges of a graph G=(V,E) is called a matching if no two edges of M share a common vertex. Given a matching M in G, a vertex v∈V is called M-saturated if there exists an edge e∈M incident with v. A matching M of a graph G is called an acyclic matching if, G[V(M)], the subgraph of G in...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 943; s. 36 - 49
Hlavní autori:	Panda, B.S., Chaudhary, Juhi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 17.01.2023
Predmet:	[formula omitted]-completeness Acyclic matching Graph algorithms Matching Polynomial-time algorithms Matching Polynomial-time algorithms Acyclic matching Graph algorithms NP-completeness APX-completeness
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!