Načítá se...
Acyclic Matching in Some Subclasses of Graphs
A subset [Formula: see text] of edges of a graph [Formula: see text] is called a matching if no two edges of M share a common vertex. A matching M in a graph G is called an acyclic matching if G[V(M)], the subgraph of G induced by the M-saturated vertices of G is acyclic. The Acyclic Matching Proble...
Uloženo v:
| Vydáno v: | Combinatorial Algorithms |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2020
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7254896/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48966-3_31 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|