Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/12488
Title: An optimal parallel solution for the path cover problem on P-4-sparse graphs
Institution and School/Department of submitter: Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών
Keywords: p-4-sparse graphs,cographs,modular decomposition,parallel algorithms,path cover,modular decomposition,algorithm,efficient,cographs
URI: https://olympias.lib.uoi.gr/jspui/handle/123456789/12488
ISSN: 0743-7315
Link: <Go to ISI>://000243614700005
http://ac.els-cdn.com/S0743731506001778/1-s2.0-S0743731506001778-main.pdf?_tid=2df661ff80562dcb3c6b05fafcfb64d8&acdnat=1339399732_3d485c9bb5062e2cfd0001a15276189b
Publisher: Elsevier
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Asdre-2007-An optimal parallel.pdf478.75 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons