W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/21433| Tytuł: | Recognizing Chordal Graphs: Lex BFS and MCS |
| Autorzy: | Arneson, Broderick Rudnicki, Piotr |
| Data wydania: | 2006 |
| Data dodania: | 5-lis-2026 |
| Wydawca: | University of Białystok |
| Źródło: | Formalized Mathematics, Volume 14, Issue 4, Pages 187-206 |
| Abstrakt: | We are formalizing the algorithm for recognizing chordal graphs by lexicographic breadth- rst search as presented in [13, Section 3 of Chapter 4, pp. 81-84]. Then we follow with a formalization of another algorithm serving the same end but based on maximum cardinality search as presented by Tarjan and Yannakakis [25]. This work is a part of the MSc work of the fi rst author under supervision of the second author. We would like to thank one of the anonymous reviewers for very useful suggestions. |
| Afiliacja: | Broderick Arneson - University of Alberta Edmonton, Canada Piotr Rudnicki - University of Alberta Edmonton, Canada |
| Sponsorzy: | This work has been partially supported by the NSERC grant OGP 9207. |
| URI: | http://hdl.handle.net/11320/21433 |
| DOI: | 10.2478/v10037-006-0022-z |
| ISSN: | 1426-2630 |
| e-ISSN: | 1898-9934 |
| Typ Dokumentu: | Article |
| metadata.dc.rights.uri: | https://creativecommons.org/licenses/by-sa/4.0/ |
| Właściciel praw: | © 2008 Broderick Arneson, Piotr Rudnicki, published by University of Białystok This work is licensed under the Creative Commons License. |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2006, Volume 14, Issue 4 |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| Recognizing_Chordal_Graphs_Lex_BFS_and_MCS.pdf | 160,13 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
