Matches in SemOpenAlex for { <https://semopenalex.org/work/W179052057> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W179052057 endingPage "423" @default.
- W179052057 startingPage "414" @default.
- W179052057 abstract "For the classical minimum spanning tree problem we introduce disjunctive constraints for pairs of edges which can not be both included in the spanning tree at the same time. These constraints are represented by a conflict graph whose vertices correspond to the edges of the original graph. Edges in the conflict graph connect conflicting edges of the original graph. It is shown that the problem becomes strongly $mathcal{NP}$ -hard even if the connected components of the conflict graph consist only of paths of length two. On the other hand, for conflict graphs consisting of disjoint edges (i.e. paths of length one) the problem remains polynomially solvable." @default.
- W179052057 created "2016-06-24" @default.
- W179052057 creator A5007835513 @default.
- W179052057 creator A5061614451 @default.
- W179052057 creator A5069744603 @default.
- W179052057 date "2009-01-01" @default.
- W179052057 modified "2023-10-16" @default.
- W179052057 title "Determining a Minimum Spanning Tree with Disjunctive Constraints" @default.
- W179052057 cites W1995443028 @default.
- W179052057 cites W2034641173 @default.
- W179052057 cites W2088776663 @default.
- W179052057 cites W2098362962 @default.
- W179052057 cites W2103267790 @default.
- W179052057 cites W2105692312 @default.
- W179052057 cites W3125944074 @default.
- W179052057 cites W4234130962 @default.
- W179052057 doi "https://doi.org/10.1007/978-3-642-04428-1_36" @default.
- W179052057 hasPublicationYear "2009" @default.
- W179052057 type Work @default.
- W179052057 sameAs 179052057 @default.
- W179052057 citedByCount "14" @default.
- W179052057 countsByYear W1790520572014 @default.
- W179052057 countsByYear W1790520572018 @default.
- W179052057 countsByYear W1790520572019 @default.
- W179052057 countsByYear W1790520572020 @default.
- W179052057 countsByYear W1790520572021 @default.
- W179052057 countsByYear W1790520572022 @default.
- W179052057 crossrefType "book-chapter" @default.
- W179052057 hasAuthorship W179052057A5007835513 @default.
- W179052057 hasAuthorship W179052057A5061614451 @default.
- W179052057 hasAuthorship W179052057A5069744603 @default.
- W179052057 hasConcept C114614502 @default.
- W179052057 hasConcept C118615104 @default.
- W179052057 hasConcept C132525143 @default.
- W179052057 hasConcept C13743678 @default.
- W179052057 hasConcept C33923547 @default.
- W179052057 hasConcept C41008148 @default.
- W179052057 hasConcept C45340560 @default.
- W179052057 hasConcept C64331007 @default.
- W179052057 hasConceptScore W179052057C114614502 @default.
- W179052057 hasConceptScore W179052057C118615104 @default.
- W179052057 hasConceptScore W179052057C132525143 @default.
- W179052057 hasConceptScore W179052057C13743678 @default.
- W179052057 hasConceptScore W179052057C33923547 @default.
- W179052057 hasConceptScore W179052057C41008148 @default.
- W179052057 hasConceptScore W179052057C45340560 @default.
- W179052057 hasConceptScore W179052057C64331007 @default.
- W179052057 hasLocation W1790520571 @default.
- W179052057 hasOpenAccess W179052057 @default.
- W179052057 hasPrimaryLocation W1790520571 @default.
- W179052057 hasRelatedWork W1978344479 @default.
- W179052057 hasRelatedWork W2020354668 @default.
- W179052057 hasRelatedWork W2032442730 @default.
- W179052057 hasRelatedWork W2062226917 @default.
- W179052057 hasRelatedWork W2069230977 @default.
- W179052057 hasRelatedWork W2157421865 @default.
- W179052057 hasRelatedWork W3080347831 @default.
- W179052057 hasRelatedWork W4301484659 @default.
- W179052057 hasRelatedWork W4302055381 @default.
- W179052057 hasRelatedWork W4312159861 @default.
- W179052057 isParatext "false" @default.
- W179052057 isRetracted "false" @default.
- W179052057 magId "179052057" @default.
- W179052057 workType "book-chapter" @default.