Facets (new session)
Description
Metadata
Settings
owl:sameAs
Inference Rule:
asEquivalent
b3s
b3sifp
facets
http://www.w3.org/2002/07/owl#
ldp
oplweb
skos-trans
virtrdf-label
virtrdf-url
None
About:
Complexity of the Packing Coloring Problem for Trees
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)
Type:
skos:Concept
http://linked.opendata.cz/ontology/domain/vavai/Vysledek
New Facet based on Instances of this Class
Attributes
Values
rdf:type
skos:Concept
http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description
In this paper, we show that the packing coloring problem is NP-complete for trees.
In this paper, we show that the packing coloring problem is NP-complete for trees.
(en)
Title
Complexity of the Packing Coloring Problem for Trees
Complexity of the Packing Coloring Problem for Trees
(en)
skos:prefLabel
Complexity of the Packing Coloring Problem for Trees
Complexity of the Packing Coloring Problem for Trees
(en)
skos:notation
RIV/00216208:11320/08:00206155!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita
P
Z
http://linked.open...avai/riv/aktivity
P(1M0545), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat
2010
http://linked.open...aciTvurceVysledku
Fiala, Jiří
http://linked.open.../riv/druhVysledku
D - Článek ve sborníku
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
360792
http://linked.open...ai/riv/idVysledku
RIV/00216208:11320/08:00206155
http://linked.open...riv/jazykVysledku
eng - angličtina
http://linked.open.../riv/klicovaSlova
Complexity; Packing; Coloring; Problem; Trees
(en)
http://linked.open.../riv/klicoveSlovo
Trees
Coloring
Complexity
Problem
Packing
http://linked.open...ontrolniKodProRIV
[EE6E70E80C26]
http://linked.open...v/mistoKonaniAkce
Berlin
http://linked.open...i/riv/mistoVydani
Berlin
http://linked.open...i/riv/nazevZdroje
Graph-theoretic concepts in Computer Science
http://linked.open...in/vavai/riv/obor
BA
http://linked.open...ichTvurcuVysledku
1
(
xsd:int
)
http://linked.open...cetTvurcuVysledku
2
(
xsd:int
)
http://linked.open...vavai/riv/projekt
Institute for Theoretical Computer Science
http://linked.open...UplatneniVysledku
2008
http://linked.open...iv/tvurceVysledku
Fiala, Jiří
Golovach, Petr
http://linked.open...vavai/riv/typAkce
WRD - Světová
http://linked.open...ain/vavai/riv/wos
000264057600013
http://linked.open.../riv/zahajeniAkce
2008-01-01
(
xsd:date
)
http://linked.open...n/vavai/riv/zamer
Moderní metody, struktury a systémy informatiky
number of pages
12
(
xsd:int
)
http://purl.org/ne...btex#hasPublisher
Springer-Verlag
https://schema.org/isbn
978-3-540-92247-6
http://localhost/t...ganizacniJednotka
11320
is
http://linked.open...avai/riv/vysledek
of
Complexity of the Packing Coloring Problem for Trees
Complexity of the Packing Coloring Problem for Trees
Complexity of the Packing Coloring Problem for Trees
Complexity of the Packing Coloring Problem for Trees
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