About: Extending Partial Representations of Subclasses of Chordal Graphs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Extending Partial Representations of Subclasses of Chordal Graphs Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension problem for chordal graphs. A partial representation specifies a tree T' and some pre-drawn subtrees. It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (keeps the pre-drawn subtrees unchanged). We consider four modifications of T' and get vastly different problems. In some cases, the problem is interesting even if just T' is given and no subtree is pre-drawn. Also, we consider three well-known subclasses of chordal graphs: Proper interval graphs, interval graphs and path graphs. We give an almost complete complexity characterization. Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension problem for chordal graphs. A partial representation specifies a tree T' and some pre-drawn subtrees. It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (keeps the pre-drawn subtrees unchanged). We consider four modifications of T' and get vastly different problems. In some cases, the problem is interesting even if just T' is given and no subtree is pre-drawn. Also, we consider three well-known subclasses of chordal graphs: Proper interval graphs, interval graphs and path graphs. We give an almost complete complexity characterization. (en)
Title	Extending Partial Representations of Subclasses of Chordal Graphs Extending Partial Representations of Subclasses of Chordal Graphs (en)
skos:prefLabel	Extending Partial Representations of Subclasses of Chordal Graphs Extending Partial Representations of Subclasses of Chordal Graphs (en)
skos:notation	RIV/00216208:11320/12:10131342!RIV13-GA0-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GEGIG/11/E023)
http://linked.open...iv/cisloPeriodika	Fall
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Kratochvíl, Jan Klavík, Pavel
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	135900
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/12:10131342
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	computational complexity; extension of representation; chordal graph; graph (en)
http://linked.open.../riv/klicoveSlovo	graph computational complexity chordal graph extension of representation
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[08C0FC39CC7D]
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Graph Drawings and Representations
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	7676
http://linked.open...iv/tvurceVysledku	Kratochvíl, Jan Klavík, Pavel Otachi, Yota Saitoh, Toshiki
issn	0302-9743
number of pages	11 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-35261-4_47
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software