Matches in SemOpenAlex for { <https://semopenalex.org/work/W2950026075> ?p ?o ?g. }
Showing items 1 to 91 of
91
with 100 items per page.
- W2950026075 abstract "We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of $n$ vertices, where each edge has an associated set of discrete availability instances (labels). A journey from vertex $u$ to vertex $v$ is a path from $u$ to $v$ where successive path edges have strictly increasing labels. A graph is temporally connected iff there is a $(u,v)$-journey for any pair of vertices $u,v,~unot= v$. We first give a simple polynomial-time algorithm to check whether a given temporal graph is temporally connected. We then consider the case in which a designer of temporal graphs can emph{freely choose} availability instances for all edges and aims for temporal connectivity with very small emph{cost}; the cost is the total number of availability instances used. We achieve this via a simple polynomial-time procedure which derives designs of cost linear in $n$. We also show that the above procedure is (almost) optimal when the underlying graph is a tree, by proving a lower bound on the cost for any tree. However, there are pragmatic cases where one is not free to design a temporally connected graph anew, but is instead emph{given} a temporal graph design with the claim that it is temporally connected, and wishes to make it more cost-efficient by removing labels without destroying temporal connectivity (redundant labels). Our main technical result is that computing the maximum number of redundant labels is APX-hard, i.e., there is no PTAS unless $P=NP$. On the positive side, we show that in dense graphs with random edge availabilities, there is asymptotically almost surely a very large number of redundant labels. A temporal design may, however, be emph{minimal}, i.e., no redundant labels exist. We show the existence of minimal temporal designs with at least $n log{n}$ labels." @default.
- W2950026075 created "2019-06-27" @default.
- W2950026075 creator A5007555796 @default.
- W2950026075 creator A5011756177 @default.
- W2950026075 creator A5018078197 @default.
- W2950026075 creator A5052366414 @default.
- W2950026075 date "2015-02-16" @default.
- W2950026075 modified "2023-10-09" @default.
- W2950026075 title "The complexity of optimal design of temporally connected graphs" @default.
- W2950026075 cites W1496893056 @default.
- W2950026075 cites W1595563493 @default.
- W2950026075 cites W1746637951 @default.
- W2950026075 cites W1847535063 @default.
- W2950026075 cites W1945448203 @default.
- W2950026075 cites W1970075049 @default.
- W2950026075 cites W1983815693 @default.
- W2950026075 cites W1984196269 @default.
- W2950026075 cites W2004308928 @default.
- W2950026075 cites W2048610995 @default.
- W2950026075 cites W2086991377 @default.
- W2950026075 cites W2105431882 @default.
- W2950026075 cites W2120741723 @default.
- W2950026075 cites W2120957127 @default.
- W2950026075 cites W2139539283 @default.
- W2950026075 cites W2156555546 @default.
- W2950026075 cites W2217013297 @default.
- W2950026075 cites W2706788079 @default.
- W2950026075 cites W2911821574 @default.
- W2950026075 cites W3004540582 @default.
- W2950026075 hasPublicationYear "2015" @default.
- W2950026075 type Work @default.
- W2950026075 sameAs 2950026075 @default.
- W2950026075 citedByCount "0" @default.
- W2950026075 crossrefType "posted-content" @default.
- W2950026075 hasAuthorship W2950026075A5007555796 @default.
- W2950026075 hasAuthorship W2950026075A5011756177 @default.
- W2950026075 hasAuthorship W2950026075A5018078197 @default.
- W2950026075 hasAuthorship W2950026075A5052366414 @default.
- W2950026075 hasConcept C114614502 @default.
- W2950026075 hasConcept C118615104 @default.
- W2950026075 hasConcept C132525143 @default.
- W2950026075 hasConcept C134306372 @default.
- W2950026075 hasConcept C199360897 @default.
- W2950026075 hasConcept C2777735758 @default.
- W2950026075 hasConcept C3018234147 @default.
- W2950026075 hasConcept C311688 @default.
- W2950026075 hasConcept C33923547 @default.
- W2950026075 hasConcept C41008148 @default.
- W2950026075 hasConcept C76444178 @default.
- W2950026075 hasConcept C77553402 @default.
- W2950026075 hasConcept C80899671 @default.
- W2950026075 hasConceptScore W2950026075C114614502 @default.
- W2950026075 hasConceptScore W2950026075C118615104 @default.
- W2950026075 hasConceptScore W2950026075C132525143 @default.
- W2950026075 hasConceptScore W2950026075C134306372 @default.
- W2950026075 hasConceptScore W2950026075C199360897 @default.
- W2950026075 hasConceptScore W2950026075C2777735758 @default.
- W2950026075 hasConceptScore W2950026075C3018234147 @default.
- W2950026075 hasConceptScore W2950026075C311688 @default.
- W2950026075 hasConceptScore W2950026075C33923547 @default.
- W2950026075 hasConceptScore W2950026075C41008148 @default.
- W2950026075 hasConceptScore W2950026075C76444178 @default.
- W2950026075 hasConceptScore W2950026075C77553402 @default.
- W2950026075 hasConceptScore W2950026075C80899671 @default.
- W2950026075 hasLocation W29500260751 @default.
- W2950026075 hasOpenAccess W2950026075 @default.
- W2950026075 hasPrimaryLocation W29500260751 @default.
- W2950026075 hasRelatedWork W1484691446 @default.
- W2950026075 hasRelatedWork W1537328843 @default.
- W2950026075 hasRelatedWork W2031140681 @default.
- W2950026075 hasRelatedWork W2116638623 @default.
- W2950026075 hasRelatedWork W2201163628 @default.
- W2950026075 hasRelatedWork W2461566632 @default.
- W2950026075 hasRelatedWork W2559735673 @default.
- W2950026075 hasRelatedWork W2593074538 @default.
- W2950026075 hasRelatedWork W2613615268 @default.
- W2950026075 hasRelatedWork W2789223017 @default.
- W2950026075 hasRelatedWork W2803473907 @default.
- W2950026075 hasRelatedWork W2945821097 @default.
- W2950026075 hasRelatedWork W2949219109 @default.
- W2950026075 hasRelatedWork W2963161417 @default.
- W2950026075 hasRelatedWork W2963857389 @default.
- W2950026075 hasRelatedWork W2965904208 @default.
- W2950026075 hasRelatedWork W2965922572 @default.
- W2950026075 hasRelatedWork W399212607 @default.
- W2950026075 hasRelatedWork W828737876 @default.
- W2950026075 hasRelatedWork W3082664529 @default.
- W2950026075 isParatext "false" @default.
- W2950026075 isRetracted "false" @default.
- W2950026075 magId "2950026075" @default.
- W2950026075 workType "article" @default.