Counting spanning trees in cographs: An algorithmic approach (Journal article)

Papadopoulos, C./ Nikolopoulos, S.

Full metadata record
DC FieldValueLanguage
dc.contributor.authorPapadopoulos, C.en
dc.contributor.authorNikolopoulos, S.en
dc.date.accessioned2015-11-24T17:22:50Z-
dc.date.available2015-11-24T17:22:50Z-
dc.identifier.issn0381-7032-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/12671-
dc.rightsDefault Licence-
dc.titleCounting spanning trees in cographs: An algorithmic approachen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.secondary<Go to ISI>://000263045400021-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.publicationDate2009-
heal.publisherCharles Babbage Research Centeren
heal.journalNameArs Combinatoriaen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
Papadopoulos-2009-counting spanning trees.pdf244.95 kBAdobe PDFView/Open    Request a copy


 Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12671
  This item is a favorite for 0 people.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.