About: Hamiltonian cycle

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Hamiltonian cycle Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FHamiltonian_cycle

Attributes	Values
rdfs:label	Hamiltonkreis (de) Hamiltonian cycle (en) Ciclo hamiltoniano (it) Cykl Hamiltona (pl) Circuito Hamiltoniano (pt) Гамильтонов цикл (ru)
rdfs:comment	Cykl Hamiltona to taki cykl w grafie, w którym każdy wierzchołek grafu odwiedzany jest dokładnie raz (oprócz pierwszego wierzchołka). Analogicznie, ścieżka Hamiltona to taka ścieżka w której każdy wierzchołek odwiedzony jest dokładnie raz. Nazwa cyklu i ścieżki pochodzi od irlandzkiego matematyka Hamiltona. Znalezienie cyklu Hamiltona o minimalnej sumie wag krawędzi jest równoważne rozwiązaniu problemu komiwojażera. Grafy zawierające cykl Hamiltona nazywamy hamiltonowskimi. (pl) Circuito Hamiltoniano em Teoria dos Grafos é um caminho em um grafo não dirigido que visita cada vértice apenas uma única vez. Um ciclo Hamiltoniano (ou circuito) visita cada vértice do grafo uma única vez, terminando no vértice de início. Determinar se existem tais caminhos (ou ciclos) em grafos é um problema NP-Completo. (pt)
Wikipage page ID	149645 (xsd:integer)
Wikipage revision ID	1023304562 (xsd:integer)
Link from a Wikipage to another Wikipage	Hamiltonian path
Wikipage redirect	Hamiltonian path
sameAs	Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle Hamiltonian cycle
has abstract	Cykl Hamiltona to taki cykl w grafie, w którym każdy wierzchołek grafu odwiedzany jest dokładnie raz (oprócz pierwszego wierzchołka). Analogicznie, ścieżka Hamiltona to taka ścieżka w której każdy wierzchołek odwiedzony jest dokładnie raz. Nazwa cyklu i ścieżki pochodzi od irlandzkiego matematyka Hamiltona. Znalezienie cyklu Hamiltona o minimalnej sumie wag krawędzi jest równoważne rozwiązaniu problemu komiwojażera. Grafy zawierające cykl Hamiltona nazywamy hamiltonowskimi. (pl) Circuito Hamiltoniano em Teoria dos Grafos é um caminho em um grafo não dirigido que visita cada vértice apenas uma única vez. Um ciclo Hamiltoniano (ou circuito) visita cada vértice do grafo uma única vez, terminando no vértice de início. Determinar se existem tais caminhos (ou ciclos) em grafos é um problema NP-Completo. (pt)
prov:wasDerivedFrom	wikipedia-en:Hamiltonian_cycle?oldid=1023304562&ns=0
page length (characters) of wiki page	30 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Hamiltonian_cycle
is Link from a Wikipage to another Wikipage of	Catalan's constant Probabilistic method Queen's graph Enneahedron List of Vanderbilt University people Michael D. Plummer Mycielskian Ménage problem Parsimonious reduction Problem Solving Through Recreational Mathematics The Library of Babel Barnette's conjecture Book embedding Answer set programming Apollonian network Arc diagram Perfect matching in high-degree hypergraphs Permutohedron Regular dodecahedron Regular graph Cube-connected cycles Cubic graph Cycle (graph theory) Cycle basis Unit distance graph Indifference graph Pearls in Graph Theory Wiener–Araya graph ♯P Complete graph Crispin Nash-Williams Crown graph Generalized Petersen graph Midsphere Petersen graph Tait's conjecture Quantum counting algorithm Clique-width Glossary of graph theory Graph minor Graph power Gray code Convex Polytopes Thomas Kirkman Quadratic bottleneck assignment problem Apex graph Combinatorics Øystein Ore Emanuels Grīnbergs Halin graph Hamiltonian completion Hamiltonian cycle polynomial Hamiltonian decomposition Icosian game PPA (complexity) Planar separator theorem Mark Ellingham Mutilated chessboard problem 1972 in science Tournament (graph theory) Travelling salesman problem Václav Chvátal Well-covered graph Wheel graph Gadget (computer science) Hashiwokakero Heawood graph Linear arboricity Lin–Kernighan heuristic Transitive reduction 5 (number) Dual graph Edge coloring

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 36 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software