Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12671Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Papadopoulos, C. | en |
| dc.contributor.author | Nikolopoulos, S. | en |
| dc.date.accessioned | 2015-11-24T17:22:50Z | - |
| dc.date.available | 2015-11-24T17:22:50Z | - |
| dc.identifier.issn | 0381-7032 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12671 | - |
| dc.rights | Default Licence | - |
| dc.title | Counting spanning trees in cographs: An algorithmic approach | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.secondary | <Go to ISI>://000263045400021 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2009 | - |
| heal.publisher | Charles Babbage Research Center | en |
| heal.journalName | Ars Combinatoria | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Papadopoulos-2009-counting spanning trees.pdf | 244.95 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
