- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2193-1801
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Efficient solution for finding Hamilton cycles in undirected graphs ; volume:5 ; number:1 ; day:28 ; month:7 ; year:2016 ; pages:1-14 ; date:12.2016
SpringerPlus ; 5, Heft 1 (28.7.2016), 1-14, 12.2016
- Urheber
-
Alhalabi, Wadee
- Beteiligte Personen und Organisationen
-
Kitanneh, Omar
Alharbi, Amira
Balfakih, Zain
Sarirete, Akila
SpringerLink (Online service)
- DOI
-
10.1186/s40064-016-2746-8
- URN
-
urn:nbn:de:1111-2016072925603
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:50 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Alhalabi, Wadee
- Kitanneh, Omar
- Alharbi, Amira
- Balfakih, Zain
- Sarirete, Akila
- SpringerLink (Online service)
Ähnliche Objekte (12)
Counting Hamilton Cycles in Dirac Hypergraphs
On Hamilton cycles and other spanning structures
On Hamilton cycles and other spanning structures
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks
Finding maximal exact matches in graphs
Finding market focus for solution business development
Dominating and longest cycles in graphs
Exact elimination of cycles in graphs
Approximate Cycles Count in Undirected Graphs
On Center Cycles in Grid Graphs
On cycles and independence in graphs
On Finding Graph Clusterings with Maximum Modularity
Counting Hamilton Cycles in Dirac Hypergraphs
On Hamilton cycles and other spanning structures
On Hamilton cycles and other spanning structures
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks
Finding maximal exact matches in graphs
Finding market focus for solution business development
Dominating and longest cycles in graphs
Exact elimination of cycles in graphs
Approximate Cycles Count in Undirected Graphs
On Center Cycles in Grid Graphs
On cycles and independence in graphs
On Finding Graph Clusterings with Maximum Modularity
Counting Hamilton Cycles in Dirac Hypergraphs
On Hamilton cycles and other spanning structures
On Hamilton cycles and other spanning structures
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks
Finding maximal exact matches in graphs
Finding market focus for solution business development
Dominating and longest cycles in graphs
Exact elimination of cycles in graphs
Approximate Cycles Count in Undirected Graphs
On Center Cycles in Grid Graphs
On cycles and independence in graphs