About: On graphs associated to posets, especially on cover-incomparability 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)

AttributesValues
rdf:type
Description
  • We deal with posets and graphs associated to them. There are several standard ways how to associate a graph to a poset. Depending on the edge-set we may obtain comparability graphs, incomparability graphs or cover graphs. We study a new notion of cover-incomparabilty graphs (defined 2008). We first list several important properties of C-I graphs and then concentrate on complexity problems concerning C-I graphs. We prove that the recognizing C-I graphs is NP-complete for generel graphs while it is polynomial for the following subclasses of chordal graphs: Ptolemaic graphs, distance-hereditary graphs, and k-trees.
  • We deal with posets and graphs associated to them. There are several standard ways how to associate a graph to a poset. Depending on the edge-set we may obtain comparability graphs, incomparability graphs or cover graphs. We study a new notion of cover-incomparabilty graphs (defined 2008). We first list several important properties of C-I graphs and then concentrate on complexity problems concerning C-I graphs. We prove that the recognizing C-I graphs is NP-complete for generel graphs while it is polynomial for the following subclasses of chordal graphs: Ptolemaic graphs, distance-hereditary graphs, and k-trees. (en)
Title
  • On graphs associated to posets, especially on cover-incomparability graphs
  • On graphs associated to posets, especially on cover-incomparability graphs (en)
skos:prefLabel
  • On graphs associated to posets, especially on cover-incomparability graphs
  • On graphs associated to posets, especially on cover-incomparability graphs (en)
skos:notation
  • RIV/60461373:22340/13:43896409!RIV14-MSM-22340___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • V
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 93721
http://linked.open...ai/riv/idVysledku
  • RIV/60461373:22340/13:43896409
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • NP-completeness; cover-incomparability graphs; posets; graphs (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [7EC11F404EAB]
http://linked.open...v/mistoKonaniAkce
  • Herbertov
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...i/riv/nazevZdroje
  • Matematika na vysokých školách
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Pavlíková, Pavla
  • Dubcová, Miroslava
  • Maxová, Jana
  • Turzík, Daniel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • České vysoké učení technické v Praze
https://schema.org/isbn
  • 978-80-01-05325-6
http://localhost/t...ganizacniJednotka
  • 22340
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software