FRINK Linked Data Fragments server

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

• W2978275643 endingPage "367" @default.
• W2978275643 startingPage "355" @default.
• W2978275643 abstract "Abstract A tree t-spanner of a graph G is a spanning subtree T in which the distance between any two adjacent vertices of G is at most t. The smallest t for which G has a tree t-spanner is called tree stretch index. The problem of determining the tree stretch index (MSST) has been studied by: establishing lower and upper bounds, based, for instance, on the girth value and on the minimum diameter spanning tree problem, respectively; and presenting some classes for which t is a tight value. In 1995, the computational complexity of MSST was settled to be NP -hard for t ≥ 4, polynomial-time solvable for t = 2. However, deciding if t = 3 still remains an open problem. In this work, we show that graphs with few P4's are 3-admissible, generalizing our previous results obtained on cographs. Considering (k,l)-graphs, which are those graphs whose vertex set that can be partitioned into k independent sets and l cliques, we partially classify the P vs NP -complete dichotomy for such a decision version. Although we prove that MSST for (2,1)-graphs is NP -hard, and knowing, beforehand, that determining the stretch index for chordal graphs is NP -hard as well, we present exact tree stretch indexes for (2,1)-chordal graphs. We also solve MSST for power cycle graphs, an interesting class under two different perspectives: they are families of (0,l)-graphs, class for which we prove it is NP -hard to determine the stretch index when l is a linear function on the size of the graph; and their stretch indexes are, at the same time, far from the natural lower bound given by the girth, and tight with respect to the diameter spanning tree upper bound." @default.
• W2978275643 created "2019-10-10" @default.
• W2978275643 creator A5035588233 @default.
• W2978275643 creator A5049521628 @default.
• W2978275643 date "2019-08-01" @default.
• W2978275643 modified "2023-10-17" @default.
• W2978275643 title "Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k,ℓ)-graphs" @default.
• W2978275643 cites W1966935039 @default.
• W2978275643 cites W1985834814 @default.
• W2978275643 cites W2004681879 @default.
• W2978275643 cites W2040514941 @default.
• W2978275643 cites W2045824107 @default.
• W2978275643 cites W2071284458 @default.
• W2978275643 cites W2087405099 @default.
• W2978275643 cites W2169648807 @default.
• W2978275643 cites W2179340953 @default.
• W2978275643 cites W2887962281 @default.
• W2978275643 cites W2912257407 @default.
• W2978275643 doi "https://doi.org/10.1016/j.entcs.2019.08.032" @default.
• W2978275643 hasPublicationYear "2019" @default.
• W2978275643 type Work @default.
• W2978275643 sameAs 2978275643 @default.
• W2978275643 citedByCount "3" @default.
• W2978275643 countsByYear W29782756432020 @default.
• W2978275643 countsByYear W29782756432021 @default.
• W2978275643 countsByYear W29782756432022 @default.
• W2978275643 crossrefType "journal-article" @default.
• W2978275643 hasAuthorship W2978275643A5035588233 @default.
• W2978275643 hasAuthorship W2978275643A5049521628 @default.
• W2978275643 hasBestOaLocation W29782756431 @default.
• W2978275643 hasConcept C102192266 @default.
• W2978275643 hasConcept C114614502 @default.
• W2978275643 hasConcept C118615104 @default.
• W2978275643 hasConcept C132525143 @default.
• W2978275643 hasConcept C160446614 @default.
• W2978275643 hasConcept C18359143 @default.
• W2978275643 hasConcept C33923547 @default.
• W2978275643 hasConcept C74133993 @default.
• W2978275643 hasConceptScore W2978275643C102192266 @default.
• W2978275643 hasConceptScore W2978275643C114614502 @default.
• W2978275643 hasConceptScore W2978275643C118615104 @default.
• W2978275643 hasConceptScore W2978275643C132525143 @default.
• W2978275643 hasConceptScore W2978275643C160446614 @default.
• W2978275643 hasConceptScore W2978275643C18359143 @default.
• W2978275643 hasConceptScore W2978275643C33923547 @default.
• W2978275643 hasConceptScore W2978275643C74133993 @default.
• W2978275643 hasLocation W29782756431 @default.
• W2978275643 hasOpenAccess W2978275643 @default.
• W2978275643 hasPrimaryLocation W29782756431 @default.
• W2978275643 hasRelatedWork W1554245510 @default.
• W2978275643 hasRelatedWork W1598023462 @default.
• W2978275643 hasRelatedWork W1994963913 @default.
• W2978275643 hasRelatedWork W2093170838 @default.
• W2978275643 hasRelatedWork W2125939925 @default.
• W2978275643 hasRelatedWork W2910018628 @default.
• W2978275643 hasRelatedWork W4200630549 @default.
• W2978275643 hasRelatedWork W4293002939 @default.
• W2978275643 hasRelatedWork W4299834500 @default.
• W2978275643 hasRelatedWork W4308902224 @default.
• W2978275643 hasVolume "346" @default.
• W2978275643 isParatext "false" @default.
• W2978275643 isRetracted "false" @default.
• W2978275643 magId "2978275643" @default.
• W2978275643 workType "article" @default.