Recognizing HHDS-free graphs

dc.contributor.author	Nikolopoulos, S. D.	en
dc.contributor.author	Palios, L.	en
dc.date.accessioned	2015-11-24T17:01:03Z
dc.date.available	2015-11-24T17:01:03Z
dc.identifier.issn	0302-9743	-
dc.identifier.uri	https://olympias.lib.uoi.gr/jspui/handle/123456789/10862
dc.rights	Default Licence	-
dc.subject	hhd-free graphs	en
dc.subject	hhds-free graphs	en
dc.subject	sun	en
dc.subject	homogeneously orderable graphs	en
dc.subject	perfectly orderable graphs	en
dc.subject	recognition	en
dc.subject	perfectly orderable graphs	en
dc.title	Recognizing HHDS-free graphs	en
heal.abstract	In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(n(2) m)-time algorithm which determines whether a graph C on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this class of graphs.	en
heal.access	campus	-
heal.fullTextAvailability	TRUE	-
heal.journalName	Graph-Theoretic Concepts in Computer Science	en
heal.journalType	peer reviewed	-
heal.language	en	-
heal.publicationDate	2005	-
heal.recordProvider	Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής	el
heal.type	journalArticle	-
heal.type.el	Άρθρο Περιοδικού	el
heal.type.en	Journal article	en

Αρχεία

Προβολή: 1 - 1 of 1