Splitters and barriers in open graphs having a perfect internal matching
A counterpart of Tutte's Theorem and Berge's formula is proved for open graphs with perfect (maximum) internal matchings. Properties of barriers and factor-critical graphs are studied in the new context, and an efficient algorithm is given to find maximal barriers of graphs having a perfec...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2008
|
| Sorozat: | Acta cybernetica
18 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12843 |
| LEADER | 01103nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12843 | ||
| 005 | 20220616143316.0 | ||
| 008 | 161015s2008 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Bartha Miklós | |
| 245 | 1 | 0 | |a Splitters and barriers in open graphs having a perfect internal matching |h [elektronikus dokumentum] / |c Bartha Miklós |
| 260 | |c 2008 | ||
| 300 | |a 697-718 | ||
| 490 | 0 | |a Acta cybernetica |v 18 No. 4 | |
| 520 | 3 | |a A counterpart of Tutte's Theorem and Berge's formula is proved for open graphs with perfect (maximum) internal matchings. Properties of barriers and factor-critical graphs are studied in the new context, and an efficient algorithm is given to find maximal barriers of graphs having a perfect internal matching. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Krész Miklós |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12843/1/Bartha_2008_ActaCybernetica.pdf |z Dokumentum-elérés |