FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3108789639> ?p ?o ?g. }

• W3108789639 endingPage "1294" @default.
• W3108789639 startingPage "1253" @default.
• W3108789639 abstract "Let G be a directed graph with n vertices and m edges, embedded on a surface S, possibly with boundary, with first Betti number $$beta $$. We consider the complexity of finding closed directed walks in G that are either contractible (trivial in homotopy) or bounding (trivial in integer homology) in S. Specifically, we describe algorithms to determine whether G contains a simple contractible cycle in $$O(n+m)$$ time, or a contractible closed walk in $$O(n+m)$$ time, or a bounding closed walk in $$O(beta (n+m))$$ time. Our algorithms rely on subtle relationships between strong connectivity in G and in the dual graph G*; our contractible-closed-walk algorithm also relies on a seminal topological result of Hass and Scott. We also prove that detecting simple bounding cycles is NP-hard. We also describe three polynomial-time algorithms to compute shortest contractible closed walks, depending on whether the fundamental group of the surface is free, abelian, or hyperbolic. A key step in our algorithm for hyperbolic surfaces is the construction of a context-free grammar with $$O(g^2L^2)$$ non-terminals that generates all contractible closed walks of length at most L, and only contractible closed walks, in a system of quads of genus $$gge 2$$. Finally, we show that computing shortest simple contractible cycles, shortest simple bounding cycles, and shortest bounding closed walks are all NP-hard. Finally, we consider the complexity of detecting negative closed walks with trivial topology, when some edges of the input graph have negative weights. We show that negative bounding walks can be detected in polynomial time, by reduction to maximum flows. We also describe polynomial-time algorithms to find negative contractible walks in graphs on the torus or any surface with boundary; the remaining case of hyperbolic surfaces remains open. The corresponding problems for simple cycles are all NP-hard." @default.
• W3108789639 created "2020-12-07" @default.
• W3108789639 creator A5042187195 @default.
• W3108789639 creator A5048393924 @default.
• W3108789639 date "2020-11-30" @default.
• W3108789639 modified "2023-09-24" @default.
• W3108789639 title "Topologically Trivial Closed Walks in Directed Surface Graphs" @default.
• W3108789639 cites W1491169489 @default.
• W3108789639 cites W1507614398 @default.
• W3108789639 cites W1522210445 @default.
• W3108789639 cites W1527270374 @default.
• W3108789639 cites W1578111061 @default.
• W3108789639 cites W1965650021 @default.
• W3108789639 cites W1974179433 @default.
• W3108789639 cites W1982231222 @default.
• W3108789639 cites W1988593903 @default.
• W3108789639 cites W1992939536 @default.
• W3108789639 cites W1993768444 @default.
• W3108789639 cites W1993901943 @default.
• W3108789639 cites W1995748051 @default.
• W3108789639 cites W1995901838 @default.
• W3108789639 cites W1998292573 @default.
• W3108789639 cites W1999973621 @default.
• W3108789639 cites W2000504285 @default.
• W3108789639 cites W2002252837 @default.
• W3108789639 cites W2006152944 @default.
• W3108789639 cites W2011824721 @default.
• W3108789639 cites W2018804864 @default.
• W3108789639 cites W2020547005 @default.
• W3108789639 cites W2025057636 @default.
• W3108789639 cites W2025861110 @default.
• W3108789639 cites W2026261955 @default.
• W3108789639 cites W2030166143 @default.
• W3108789639 cites W2033356880 @default.
• W3108789639 cites W2038124553 @default.
• W3108789639 cites W2041200781 @default.
• W3108789639 cites W2044472590 @default.
• W3108789639 cites W2053537689 @default.
• W3108789639 cites W2057174784 @default.
• W3108789639 cites W2057266558 @default.
• W3108789639 cites W2058391145 @default.
• W3108789639 cites W2059957243 @default.
• W3108789639 cites W2060075372 @default.
• W3108789639 cites W2066108505 @default.
• W3108789639 cites W2073723685 @default.
• W3108789639 cites W2076912520 @default.
• W3108789639 cites W2077970810 @default.
• W3108789639 cites W2078498425 @default.
• W3108789639 cites W2079926883 @default.
• W3108789639 cites W2082719291 @default.
• W3108789639 cites W2090359754 @default.
• W3108789639 cites W2095896857 @default.
• W3108789639 cites W2109920117 @default.
• W3108789639 cites W2122542302 @default.
• W3108789639 cites W2128333270 @default.
• W3108789639 cites W2139378242 @default.
• W3108789639 cites W2147508044 @default.
• W3108789639 cites W2149342630 @default.
• W3108789639 cites W2163318198 @default.
• W3108789639 cites W2166937960 @default.
• W3108789639 cites W2569270235 @default.
• W3108789639 cites W2581341131 @default.
• W3108789639 cites W2771096659 @default.
• W3108789639 cites W2964012127 @default.
• W3108789639 cites W2964155548 @default.
• W3108789639 cites W3104267565 @default.
• W3108789639 cites W3105832020 @default.
• W3108789639 cites W3108789639 @default.
• W3108789639 cites W4210925048 @default.
• W3108789639 cites W4235484205 @default.
• W3108789639 cites W4242029970 @default.
• W3108789639 cites W4242757385 @default.
• W3108789639 cites W4250271701 @default.
• W3108789639 doi "https://doi.org/10.1007/s00454-020-00255-3" @default.
• W3108789639 hasPublicationYear "2020" @default.
• W3108789639 type Work @default.
• W3108789639 sameAs 3108789639 @default.
• W3108789639 citedByCount "1" @default.
• W3108789639 countsByYear W31087896392020 @default.
• W3108789639 crossrefType "journal-article" @default.
• W3108789639 hasAuthorship W3108789639A5042187195 @default.
• W3108789639 hasAuthorship W3108789639A5048393924 @default.
• W3108789639 hasBestOaLocation W31087896392 @default.
• W3108789639 hasConcept C105795698 @default.
• W3108789639 hasConcept C114614502 @default.
• W3108789639 hasConcept C118615104 @default.
• W3108789639 hasConcept C121194460 @default.
• W3108789639 hasConcept C129621563 @default.
• W3108789639 hasConcept C169611556 @default.
• W3108789639 hasConcept C187929450 @default.
• W3108789639 hasConcept C202444582 @default.
• W3108789639 hasConcept C33923547 @default.
• W3108789639 hasConcept C5961521 @default.
• W3108789639 hasConceptScore W3108789639C105795698 @default.
• W3108789639 hasConceptScore W3108789639C114614502 @default.
• W3108789639 hasConceptScore W3108789639C118615104 @default.
• W3108789639 hasConceptScore W3108789639C121194460 @default.
• W3108789639 hasConceptScore W3108789639C129621563 @default.

• next