About: Noncrossing Hamiltonian paths in geometric 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
  • Hamiltonian path is a path visiting all vertices of a graph. The path is non-crossing if it does not cross itself. We study what is the minimum number edges of complete geometic graph you have to remove to guarantee there is no non-crossing Hamiltonian path.
  • Hamiltonian path is a path visiting all vertices of a graph. The path is non-crossing if it does not cross itself. We study what is the minimum number edges of complete geometic graph you have to remove to guarantee there is no non-crossing Hamiltonian path. (en)
  • Hamiltonovská cesta v grafu je cesta, která prochází všechny vrcholy. Nekřížící se cesta je nakreslení cesty do roviny, které se nekříží. Úkolem je zjistit, kolik nejméně hran z úplného geometrického grafu musíme vymazat, aby ve zbytku neexistovala nekřízící se hamiltovnoská cesta. (cs)
Title
  • Noncrossing Hamiltonian paths in geometric graphs
  • Nekřížící se Hamiltonovské cesty v geometrických grafech (cs)
  • Noncrossing Hamiltonian paths in geometric graphs (en)
skos:prefLabel
  • Noncrossing Hamiltonian paths in geometric graphs
  • Nekřížící se Hamiltonovské cesty v geometrických grafech (cs)
  • Noncrossing Hamiltonian paths in geometric graphs (en)
skos:notation
  • RIV/00216208:11320/07:00004866!RIV08-MSM-11320___
http://linked.open.../vavai/riv/strany
  • 1096;1105
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika
  • 9
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
  • 437470
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/07:00004866
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Noncrossing; Hamiltonian; paths; geometric; graphs (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [9751E7F315CB]
http://linked.open...i/riv/nazevZdroje
  • Discrete Applied Mathematics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 155
http://linked.open...iv/tvurceVysledku
  • Jelínek, Vít
  • Černý, Jakub
  • Kára, Jan
http://linked.open...n/vavai/riv/zamer
issn
  • 0166-218X
number of pages
http://localhost/t...ganizacniJednotka
  • 11320
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, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software