Matches in SemOpenAlex for { <https://semopenalex.org/work/W4289760637> ?p ?o ?g. }
Showing items 1 to 48 of
48
with 100 items per page.
- W4289760637 abstract "A reassembling of a simple graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. There are several equivalent definitions of graph reassembling; in this report we use a definition which makes it closest to the notion of graph carving. A reassembling is a rooted binary tree whose nodes are subsets of V and whose leaf nodes are singleton sets, with each of the latter containing a distinct vertex of G. The parent of two nodes in the reassembling is the union of the two children's vertex sets. The root node of the reassembling is the full set V. The edge-boundary degree of a node in the reassembling is the number of edges in G that connect vertices in the node's set to vertices not in the node's set. A reassembling's alpha-measure is the largest edge-boundary degree of any node in the reassembling. A reassembling of G is alpha-optimal if its alpha-measure is the minimum among all alpha-measures of G's reassemblings. The problem of finding an alpha-optimal reassembling of a simple graph in general was already shown to be NP-hard. In this report we present an algorithm which, given a 3-regular plane graph G = (V,E) as input, returns a reassembling of G with an alpha-measure independent of n (number of vertices in G) and upper-bounded by 2k, where k is the edge-outerplanarity of G. (Edge-outerplanarity is distinct but closely related to the usual notion of outerplanarity; as with outerplanarity, for a fixed edge-outerplanarity k, the number n of vertices can be arbitrarily large.) Our algorithm runs in time linear in n. Moreover, we construct a class of $3$-regular plane graphs for which this alpha-measure is optimal, by proving that 2k is the lower bound on the alpha-measure of any reassembling of a graph in that class." @default.
- W4289760637 created "2022-08-04" @default.
- W4289760637 creator A5002869585 @default.
- W4289760637 creator A5090898185 @default.
- W4289760637 date "2018-07-10" @default.
- W4289760637 modified "2023-10-14" @default.
- W4289760637 title "Efficient Reassembling of Three-Regular Planar Graphs" @default.
- W4289760637 doi "https://doi.org/10.48550/arxiv.1807.03479" @default.
- W4289760637 hasPublicationYear "2018" @default.
- W4289760637 type Work @default.
- W4289760637 citedByCount "0" @default.
- W4289760637 crossrefType "posted-content" @default.
- W4289760637 hasAuthorship W4289760637A5002869585 @default.
- W4289760637 hasAuthorship W4289760637A5090898185 @default.
- W4289760637 hasBestOaLocation W42897606371 @default.
- W4289760637 hasConcept C114614502 @default.
- W4289760637 hasConcept C118615104 @default.
- W4289760637 hasConcept C132525143 @default.
- W4289760637 hasConcept C134306372 @default.
- W4289760637 hasConcept C2779145032 @default.
- W4289760637 hasConcept C33923547 @default.
- W4289760637 hasConcept C34388435 @default.
- W4289760637 hasConcept C80899671 @default.
- W4289760637 hasConceptScore W4289760637C114614502 @default.
- W4289760637 hasConceptScore W4289760637C118615104 @default.
- W4289760637 hasConceptScore W4289760637C132525143 @default.
- W4289760637 hasConceptScore W4289760637C134306372 @default.
- W4289760637 hasConceptScore W4289760637C2779145032 @default.
- W4289760637 hasConceptScore W4289760637C33923547 @default.
- W4289760637 hasConceptScore W4289760637C34388435 @default.
- W4289760637 hasConceptScore W4289760637C80899671 @default.
- W4289760637 hasLocation W42897606371 @default.
- W4289760637 hasLocation W42897606372 @default.
- W4289760637 hasOpenAccess W4289760637 @default.
- W4289760637 hasPrimaryLocation W42897606371 @default.
- W4289760637 hasRelatedWork W1601007368 @default.
- W4289760637 hasRelatedWork W2047600543 @default.
- W4289760637 hasRelatedWork W2082494488 @default.
- W4289760637 hasRelatedWork W2159377379 @default.
- W4289760637 hasRelatedWork W2374778222 @default.
- W4289760637 hasRelatedWork W2549740858 @default.
- W4289760637 hasRelatedWork W2898165430 @default.
- W4289760637 hasRelatedWork W2998116189 @default.
- W4289760637 hasRelatedWork W3213496305 @default.
- W4289760637 hasRelatedWork W4206244388 @default.
- W4289760637 isParatext "false" @default.
- W4289760637 isRetracted "false" @default.
- W4289760637 workType "article" @default.