Matches in SemOpenAlex for { <https://semopenalex.org/work/W1968952709> ?p ?o ?g. }
Showing items 1 to 80 of
80
with 100 items per page.
- W1968952709 abstract "For an even integer t ≥ 2, the Matching Connectivity matrix Ht is a matrix that has rows and columns both labeled by all perfect matchings of the complete graph Kt on t vertices; an entry Ht[M1,M2] is 1 if M1∪ M2 is a Hamiltonian cycle and 0 otherwise. Motivated by the computational study of the Hamiltonicity problem, we present three results on the structure of Ht: We first show that Ht has rank exactly 2t/2-1 over GF(2) via an appropriate factorization that explicitly provides families of matchings Xt forming bases for Ht. Second, we show how to quickly change representation between such bases. Third, we notice that the sets of matchings Xt induce permutation matrices within Ht. We use the factorization to derive an 1.888n nO(1) time Monte Carlo algorithm that solves the Hamiltonicity problem in directed bipartite graphs. Our algorithm as well counts the number of Hamiltonian cycles modulo two in directed bipartite or undirected graphs in the same time bound. Moreover, we use the fast basis change algorithm from the second result to present a Monte Carlo algorithm that given an undirected graph on n vertices along with a path decomposition of width at most pw decides Hamiltonicity in (2+√2)pw nO(1) time. Finally, we use the third result to show that for every e >0 this cannot be improved to (2+√2-e)pwnO(1) time unless the Strong Exponential Time Hypothesis fails, i.e., a faster algorithm for this problem would imply the breakthrough result of an O((2-e')n) time algorithm for CNF-Sat." @default.
- W1968952709 created "2016-06-24" @default.
- W1968952709 creator A5037989463 @default.
- W1968952709 creator A5050140825 @default.
- W1968952709 creator A5068357631 @default.
- W1968952709 date "2013-06-01" @default.
- W1968952709 modified "2023-10-03" @default.
- W1968952709 title "Fast hamiltonicity checking via bases of perfect matchings" @default.
- W1968952709 cites W1787126581 @default.
- W1968952709 cites W1883368305 @default.
- W1968952709 cites W1971483538 @default.
- W1968952709 cites W1975286948 @default.
- W1968952709 cites W1975587904 @default.
- W1968952709 cites W1982687611 @default.
- W1968952709 cites W1995725694 @default.
- W1968952709 cites W1996668544 @default.
- W1968952709 cites W2001868457 @default.
- W1968952709 cites W2002722727 @default.
- W1968952709 cites W2015321560 @default.
- W1968952709 cites W2015963099 @default.
- W1968952709 cites W2028357390 @default.
- W1968952709 cites W2042986967 @default.
- W1968952709 cites W2059273723 @default.
- W1968952709 cites W2065963401 @default.
- W1968952709 cites W2126436716 @default.
- W1968952709 cites W2139087151 @default.
- W1968952709 cites W2151732151 @default.
- W1968952709 cites W2154399201 @default.
- W1968952709 cites W2165142526 @default.
- W1968952709 cites W2174446922 @default.
- W1968952709 cites W2296469570 @default.
- W1968952709 cites W2508797883 @default.
- W1968952709 cites W2610479830 @default.
- W1968952709 cites W4298227433 @default.
- W1968952709 doi "https://doi.org/10.1145/2488608.2488646" @default.
- W1968952709 hasPublicationYear "2013" @default.
- W1968952709 type Work @default.
- W1968952709 sameAs 1968952709 @default.
- W1968952709 citedByCount "46" @default.
- W1968952709 countsByYear W19689527092013 @default.
- W1968952709 countsByYear W19689527092014 @default.
- W1968952709 countsByYear W19689527092015 @default.
- W1968952709 countsByYear W19689527092016 @default.
- W1968952709 countsByYear W19689527092017 @default.
- W1968952709 countsByYear W19689527092018 @default.
- W1968952709 countsByYear W19689527092019 @default.
- W1968952709 countsByYear W19689527092020 @default.
- W1968952709 countsByYear W19689527092021 @default.
- W1968952709 countsByYear W19689527092022 @default.
- W1968952709 crossrefType "proceedings-article" @default.
- W1968952709 hasAuthorship W1968952709A5037989463 @default.
- W1968952709 hasAuthorship W1968952709A5050140825 @default.
- W1968952709 hasAuthorship W1968952709A5068357631 @default.
- W1968952709 hasBestOaLocation W19689527092 @default.
- W1968952709 hasConcept C114614502 @default.
- W1968952709 hasConcept C33923547 @default.
- W1968952709 hasConcept C41008148 @default.
- W1968952709 hasConceptScore W1968952709C114614502 @default.
- W1968952709 hasConceptScore W1968952709C33923547 @default.
- W1968952709 hasConceptScore W1968952709C41008148 @default.
- W1968952709 hasLocation W19689527091 @default.
- W1968952709 hasLocation W19689527092 @default.
- W1968952709 hasLocation W19689527093 @default.
- W1968952709 hasLocation W19689527094 @default.
- W1968952709 hasOpenAccess W1968952709 @default.
- W1968952709 hasPrimaryLocation W19689527091 @default.
- W1968952709 hasRelatedWork W2093578348 @default.
- W1968952709 hasRelatedWork W2350741829 @default.
- W1968952709 hasRelatedWork W2358668433 @default.
- W1968952709 hasRelatedWork W2376932109 @default.
- W1968952709 hasRelatedWork W2382290278 @default.
- W1968952709 hasRelatedWork W2390279801 @default.
- W1968952709 hasRelatedWork W2748952813 @default.
- W1968952709 hasRelatedWork W2766271392 @default.
- W1968952709 hasRelatedWork W2899084033 @default.
- W1968952709 hasRelatedWork W3004735627 @default.
- W1968952709 isParatext "false" @default.
- W1968952709 isRetracted "false" @default.
- W1968952709 magId "1968952709" @default.
- W1968952709 workType "article" @default.