Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12439Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Heggernes, P. | en |
| dc.contributor.author | Mancini, F. | en |
| dc.contributor.author | Papadopoulos, C. | en |
| dc.contributor.author | Sritharan, R. | en |
| dc.date.accessioned | 2015-11-24T17:21:14Z | - |
| dc.date.available | 2015-11-24T17:21:14Z | - |
| dc.identifier.issn | 1382-6905 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12439 | - |
| dc.rights | Default Licence | - |
| dc.subject | minimal completions | en |
| dc.subject | sandwich monotonicity | en |
| dc.subject | strongly chordal graphs | en |
| dc.subject | chordal bipartite graphs | en |
| dc.subject | minimum fill-in | en |
| dc.subject | completions | en |
| dc.subject | treewidth | en |
| dc.subject | separators | en |
| dc.subject | algorithms | en |
| dc.subject | complexity | en |
| dc.title | Strongly chordal and chordal bipartite graphs are sandwich monotone | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1007/s10878-010-9322-x | - |
| heal.identifier.secondary | <Go to ISI>://000294536500010 | - |
| heal.identifier.secondary | http://www.springerlink.com/content/6232678134j68v46/fulltext.pdf | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2011 | - |
| heal.abstract | A graph class is sandwich monotone if, for every pair of its graphs G (1)=(V,E (1)) and G (2)=(V,E (2)) with E (1)aS,E (2), there is an ordering e (1),aEuro broken vertical bar,e (k) of the edges in E (2)a-E (1) such that G=(V,E (1)a(a){e (1),aEuro broken vertical bar,e (i) }) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakonyi and Bono (Czechoslov. Math. J. 46:577-583, 1997). So far, very few classes have been proved to be sandwich monotone, and the most famous of these are chordal graphs. Sandwich monotonicity of a graph class implies that minimal completions of arbitrary graphs into that class can be recognized and computed in polynomial time. For minimal completions into strongly chordal or chordal bipartite graphs no polynomial-time algorithm has been known. With our results such algorithms follow for both classes. In addition, from our results it follows that all strongly chordal graphs and all chordal bipartite graphs with edge constraints can be listed efficiently. | en |
| heal.publisher | Springer Verlag (Germany) | en |
| heal.journalName | Journal of Combinatorial Optimization | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Heggernes-2011-Strongly chordal and.pdf | 634.14 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
