Matches in SemOpenAlex for { <https://semopenalex.org/work/W2008391796> ?p ?o ?g. }
Showing items 1 to 58 of
58
with 100 items per page.
- W2008391796 endingPage "4591" @default.
- W2008391796 startingPage "4579" @default.
- W2008391796 abstract "We show that each 4-regular n -vertex graph contains at most O ( 1 8 n / 5 ) ≤ O ( 1.78 3 n ) Hamilton cycles, which improves a previous bound by Sharir and Welzl. From the other side we exhibit a family of graphs with 4 8 n / 8 ≥ 1.62 2 n Hamilton cycles per graph. Moreover, we present an algorithm which finds the minimum weight Hamilton cycle of a given 4-regular graph in time 3 n ⋅ poly ( n ) = O ( 1.73 3 n ) , improving on Eppstein’s previous bound. This algorithm can be modified to compute the number of Hamilton cycles in the same time bound and to enumerate all Hamilton cycles in time ( 3 n + hc ( G ) ) ⋅ poly ( n ) with hc ( G ) denoting the number of Hamilton cycles of the given graph G . So our upper bound of O ( 1.78 3 n ) for the number of Hamilton cycles serves also as a time bound for enumeration." @default.
- W2008391796 created "2016-06-24" @default.
- W2008391796 creator A5044963823 @default.
- W2008391796 date "2011-08-01" @default.
- W2008391796 modified "2023-10-16" @default.
- W2008391796 title "Finding and enumerating Hamilton cycles in 4-regular graphs" @default.
- W2008391796 cites W1542928981 @default.
- W2008391796 cites W1969186119 @default.
- W2008391796 cites W2296469570 @default.
- W2008391796 cites W2508797883 @default.
- W2008391796 doi "https://doi.org/10.1016/j.tcs.2011.04.038" @default.
- W2008391796 hasPublicationYear "2011" @default.
- W2008391796 type Work @default.
- W2008391796 sameAs 2008391796 @default.
- W2008391796 citedByCount "14" @default.
- W2008391796 countsByYear W20083917962012 @default.
- W2008391796 countsByYear W20083917962013 @default.
- W2008391796 countsByYear W20083917962014 @default.
- W2008391796 countsByYear W20083917962015 @default.
- W2008391796 countsByYear W20083917962017 @default.
- W2008391796 countsByYear W20083917962020 @default.
- W2008391796 countsByYear W20083917962022 @default.
- W2008391796 crossrefType "journal-article" @default.
- W2008391796 hasAuthorship W2008391796A5044963823 @default.
- W2008391796 hasBestOaLocation W20083917961 @default.
- W2008391796 hasConcept C114614502 @default.
- W2008391796 hasConcept C118615104 @default.
- W2008391796 hasConcept C132525143 @default.
- W2008391796 hasConcept C33923547 @default.
- W2008391796 hasConcept C41008148 @default.
- W2008391796 hasConcept C86524685 @default.
- W2008391796 hasConceptScore W2008391796C114614502 @default.
- W2008391796 hasConceptScore W2008391796C118615104 @default.
- W2008391796 hasConceptScore W2008391796C132525143 @default.
- W2008391796 hasConceptScore W2008391796C33923547 @default.
- W2008391796 hasConceptScore W2008391796C41008148 @default.
- W2008391796 hasConceptScore W2008391796C86524685 @default.
- W2008391796 hasIssue "35" @default.
- W2008391796 hasLocation W20083917961 @default.
- W2008391796 hasOpenAccess W2008391796 @default.
- W2008391796 hasPrimaryLocation W20083917961 @default.
- W2008391796 hasRelatedWork W1499086829 @default.
- W2008391796 hasRelatedWork W1572529423 @default.
- W2008391796 hasRelatedWork W1978219832 @default.
- W2008391796 hasRelatedWork W2006880377 @default.
- W2008391796 hasRelatedWork W2037778884 @default.
- W2008391796 hasRelatedWork W2068932826 @default.
- W2008391796 hasRelatedWork W2890221297 @default.
- W2008391796 hasRelatedWork W2912339235 @default.
- W2008391796 hasRelatedWork W4300995996 @default.
- W2008391796 hasRelatedWork W2985690467 @default.
- W2008391796 hasVolume "412" @default.
- W2008391796 isParatext "false" @default.
- W2008391796 isRetracted "false" @default.
- W2008391796 magId "2008391796" @default.
- W2008391796 workType "article" @default.