Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11017| Title: | Counting Spanning Trees in Cographs: An Algorithmic Approach |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | cographs,p(4)-reducible graphs,number of spanning trees,modular decomposition,combinatorial problems,algorithms,complexity,recognition algorithm,threshold graphs,number,circulant |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/11017 |
| ISSN: | 0381-7032 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nikolopoulos-2009-Counting Spanning Trees in Cographs An Algorithmic Approach.pdf | 244.95 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
