FRINK Linked Data Fragments server

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

• W2034199804 endingPage "201" @default.
• W2034199804 startingPage "183" @default.
• W2034199804 abstract "We study the complexity of the Accretive Graph Assembly Problem ( $${tt{AGAP}}$$ ). An instance of $${tt{AGAP}}$$ consists of an edge-weighted graph G, a seed vertex in G, and a temperature τ. The goal is to determine if the graph G can be assembled by a sequence of vertex additions starting from the seed vertex. The edge weights model the forces of attraction and repulsion, and determine which vertices can be added to a partially assembled graph at the given temperature. A vertex can be added when the total weight to its already built neighbors in the graph is at least τ. The assembly process is sequential meaning that only one vertex can be added at a time. Our first result is that $${tt{AGAP}}$$ is NP-complete even on planar graphs with maximum degree 3 when edges have only two different types of weights. This resolves the complexity of $${tt{AGAP}}$$ in the sense that the problem is poly-time solvable when either the maximum degree is at most 2 or the number of distinct edge weights is one, and is NP-complete otherwise. Our second result is a dichotomy theorem that completely characterizes the complexity of $${tt{AGAP}}$$ on graphs with maximum degree 3 and two distinct weights: w p and w n . We give a simple system of linear constraints on w p , w n , and τ that determines whether the problem is NP-complete or is poly-time solvable. In the process of establishing this dichotomy, we give a poly-time algorithm to solve a non-trivial class of $${tt{AGAP}}.$$ Finally, we consider the optimization version of $${tt{AGAP}}$$ where the goal is to assemble a largest-possible induced subgraph of the given input graph. We show that even on graphs that can be assembled and have maximum degree 3, it is NP-hard to assemble a (1/n 1-ε)-fraction of the input graph for any $$varepsilon > 0;$$ here n denotes the number of vertices in G." @default.
• W2034199804 created "2016-06-24" @default.
• W2034199804 creator A5025237352 @default.
• W2034199804 creator A5039619350 @default.
• W2034199804 creator A5078183964 @default.
• W2034199804 date "2007-10-02" @default.
• W2034199804 modified "2023-09-24" @default.
• W2034199804 title "On the complexity of graph self-assembly in accretive systems" @default.
• W2034199804 cites W1491169489 @default.
• W2034199804 cites W1530081929 @default.
• W2034199804 cites W1567090568 @default.
• W2034199804 cites W1981863124 @default.
• W2034199804 cites W1982939827 @default.
• W2034199804 cites W1983241546 @default.
• W2034199804 cites W1984408592 @default.
• W2034199804 cites W2019553804 @default.
• W2034199804 cites W2027804504 @default.
• W2034199804 cites W2042209159 @default.
• W2034199804 cites W2042481641 @default.
• W2034199804 cites W2060635370 @default.
• W2034199804 cites W2066577300 @default.
• W2034199804 cites W2068744615 @default.
• W2034199804 cites W2078194093 @default.
• W2034199804 cites W2079833031 @default.
• W2034199804 cites W2096270193 @default.
• W2034199804 cites W2139317321 @default.
• W2034199804 cites W2163041701 @default.
• W2034199804 cites W2167160788 @default.
• W2034199804 cites W2169767423 @default.
• W2034199804 cites W2949114084 @default.
• W2034199804 cites W50830506 @default.
• W2034199804 doi "https://doi.org/10.1007/s11047-007-9048-6" @default.
• W2034199804 hasPublicationYear "2007" @default.
• W2034199804 type Work @default.
• W2034199804 sameAs 2034199804 @default.
• W2034199804 citedByCount "3" @default.
• W2034199804 crossrefType "journal-article" @default.
• W2034199804 hasAuthorship W2034199804A5025237352 @default.
• W2034199804 hasAuthorship W2034199804A5039619350 @default.
• W2034199804 hasAuthorship W2034199804A5078183964 @default.
• W2034199804 hasBestOaLocation W20341998042 @default.
• W2034199804 hasConcept C11413529 @default.
• W2034199804 hasConcept C114614502 @default.
• W2034199804 hasConcept C118615104 @default.
• W2034199804 hasConcept C132525143 @default.
• W2034199804 hasConcept C24858836 @default.
• W2034199804 hasConcept C311688 @default.
• W2034199804 hasConcept C33923547 @default.
• W2034199804 hasConcept C80899671 @default.
• W2034199804 hasConceptScore W2034199804C11413529 @default.
• W2034199804 hasConceptScore W2034199804C114614502 @default.
• W2034199804 hasConceptScore W2034199804C118615104 @default.
• W2034199804 hasConceptScore W2034199804C132525143 @default.
• W2034199804 hasConceptScore W2034199804C24858836 @default.
• W2034199804 hasConceptScore W2034199804C311688 @default.
• W2034199804 hasConceptScore W2034199804C33923547 @default.
• W2034199804 hasConceptScore W2034199804C80899671 @default.
• W2034199804 hasIssue "2" @default.
• W2034199804 hasLocation W20341998041 @default.
• W2034199804 hasLocation W20341998042 @default.
• W2034199804 hasOpenAccess W2034199804 @default.
• W2034199804 hasPrimaryLocation W20341998041 @default.
• W2034199804 hasRelatedWork W1719252778 @default.
• W2034199804 hasRelatedWork W2008276241 @default.
• W2034199804 hasRelatedWork W2031098440 @default.
• W2034199804 hasRelatedWork W2034217845 @default.
• W2034199804 hasRelatedWork W2169820283 @default.
• W2034199804 hasRelatedWork W2374778222 @default.
• W2034199804 hasRelatedWork W2555545330 @default.
• W2034199804 hasRelatedWork W4306705875 @default.
• W2034199804 hasRelatedWork W4307385446 @default.
• W2034199804 hasRelatedWork W922283457 @default.
• W2034199804 hasVolume "7" @default.
• W2034199804 isParatext "false" @default.
• W2034199804 isRetracted "false" @default.
• W2034199804 magId "2034199804" @default.
• W2034199804 workType "article" @default.