Matches in SemOpenAlex for { <https://semopenalex.org/work/W183031105> ?p ?o ?g. }
Showing items 1 to 95 of
95
with 100 items per page.
- W183031105 endingPage "160" @default.
- W183031105 startingPage "149" @default.
- W183031105 abstract "AbstractTwo spanning trees of an undirected graph are totally independent if they are edge disjoint and if the unique paths that connect any pair of vertices in these trees are also node disjoint. Accordingly, (K ge 2) spanning trees are totally independent if they are pairwise totally independent. The problem of finding (K) totally independent spanning trees (KTIST) or proving that no such trees do exist is NP-Complete. We investigate KTIST and an optimization problem which consists of finding (K) totally independent spanning trees with the minimum possible number of central nodes. Both problems have applications in the design of interconnection networks. We propose an integer programming formulation, valid inequalities and a Branch-and-cut algorithm to solve them. We also present an experimental evaluation of such an algorithm.KeywordsCombinatorial optimizationTotally independent spanning treesPacking connected dominating setsBranch-and-cut algorithms" @default.
- W183031105 created "2016-06-24" @default.
- W183031105 creator A5014333403 @default.
- W183031105 creator A5015109379 @default.
- W183031105 date "2014-01-01" @default.
- W183031105 modified "2023-09-27" @default.
- W183031105 title "Finding Totally Independent Spanning Trees with Linear Integer Programming" @default.
- W183031105 cites W173023041 @default.
- W183031105 cites W1967548269 @default.
- W183031105 cites W1970767312 @default.
- W183031105 cites W1974912205 @default.
- W183031105 cites W2002872142 @default.
- W183031105 cites W2022175859 @default.
- W183031105 cites W2042706982 @default.
- W183031105 cites W2054018737 @default.
- W183031105 cites W2063585532 @default.
- W183031105 cites W2069643240 @default.
- W183031105 cites W2077515067 @default.
- W183031105 cites W2083790738 @default.
- W183031105 cites W2095183018 @default.
- W183031105 cites W2120414727 @default.
- W183031105 cites W2124608963 @default.
- W183031105 cites W2137804648 @default.
- W183031105 cites W2141455535 @default.
- W183031105 cites W2148237104 @default.
- W183031105 cites W2148636444 @default.
- W183031105 cites W2151141449 @default.
- W183031105 cites W2159421784 @default.
- W183031105 cites W2162483260 @default.
- W183031105 cites W2165926628 @default.
- W183031105 cites W2172222998 @default.
- W183031105 cites W2172652468 @default.
- W183031105 cites W3141863997 @default.
- W183031105 cites W4211176206 @default.
- W183031105 doi "https://doi.org/10.1007/978-3-319-09174-7_13" @default.
- W183031105 hasPublicationYear "2014" @default.
- W183031105 type Work @default.
- W183031105 sameAs 183031105 @default.
- W183031105 citedByCount "0" @default.
- W183031105 crossrefType "book-chapter" @default.
- W183031105 hasAuthorship W183031105A5014333403 @default.
- W183031105 hasAuthorship W183031105A5015109379 @default.
- W183031105 hasConcept C11413529 @default.
- W183031105 hasConcept C114614502 @default.
- W183031105 hasConcept C118615104 @default.
- W183031105 hasConcept C132525143 @default.
- W183031105 hasConcept C13743678 @default.
- W183031105 hasConcept C154945302 @default.
- W183031105 hasConcept C184898388 @default.
- W183031105 hasConcept C23394520 @default.
- W183031105 hasConcept C33923547 @default.
- W183031105 hasConcept C37810922 @default.
- W183031105 hasConcept C41008148 @default.
- W183031105 hasConcept C41045048 @default.
- W183031105 hasConcept C45340560 @default.
- W183031105 hasConcept C56086750 @default.
- W183031105 hasConcept C63645285 @default.
- W183031105 hasConcept C64331007 @default.
- W183031105 hasConcept C65949645 @default.
- W183031105 hasConceptScore W183031105C11413529 @default.
- W183031105 hasConceptScore W183031105C114614502 @default.
- W183031105 hasConceptScore W183031105C118615104 @default.
- W183031105 hasConceptScore W183031105C132525143 @default.
- W183031105 hasConceptScore W183031105C13743678 @default.
- W183031105 hasConceptScore W183031105C154945302 @default.
- W183031105 hasConceptScore W183031105C184898388 @default.
- W183031105 hasConceptScore W183031105C23394520 @default.
- W183031105 hasConceptScore W183031105C33923547 @default.
- W183031105 hasConceptScore W183031105C37810922 @default.
- W183031105 hasConceptScore W183031105C41008148 @default.
- W183031105 hasConceptScore W183031105C41045048 @default.
- W183031105 hasConceptScore W183031105C45340560 @default.
- W183031105 hasConceptScore W183031105C56086750 @default.
- W183031105 hasConceptScore W183031105C63645285 @default.
- W183031105 hasConceptScore W183031105C64331007 @default.
- W183031105 hasConceptScore W183031105C65949645 @default.
- W183031105 hasLocation W1830311051 @default.
- W183031105 hasOpenAccess W183031105 @default.
- W183031105 hasPrimaryLocation W1830311051 @default.
- W183031105 hasRelatedWork W183031105 @default.
- W183031105 hasRelatedWork W2099915933 @default.
- W183031105 hasRelatedWork W2109692093 @default.
- W183031105 hasRelatedWork W2138987445 @default.
- W183031105 hasRelatedWork W2387385213 @default.
- W183031105 hasRelatedWork W2390742649 @default.
- W183031105 hasRelatedWork W2418231958 @default.
- W183031105 hasRelatedWork W2589768050 @default.
- W183031105 hasRelatedWork W3016811403 @default.
- W183031105 hasRelatedWork W2943635264 @default.
- W183031105 isParatext "false" @default.
- W183031105 isRetracted "false" @default.
- W183031105 magId "183031105" @default.
- W183031105 workType "book-chapter" @default.