Matches in SemOpenAlex for { <https://semopenalex.org/work/W2279531134> ?p ?o ?g. }
Showing items 1 to 92 of
92
with 100 items per page.
- W2279531134 endingPage "919" @default.
- W2279531134 startingPage "914" @default.
- W2279531134 abstract "One paradigm for optimizing the efficiency of solutions to instances of a difficult problem is to factor the problem into subcases and to optimize the solution for each subcase. Although an optimal solution for the general problem may not be found by this approach, near optimal solutions may be found for many particular instances. This is the approach illustrated by the following problem domain. When designing a network (communication, computing etc.) it may be necessary to impose the following constraint: Given N and M with N < M, for each path from node (u) to node (v) of length M, there must exist a path from (u) to (v), passing through a subset of the same intermediate nodes, of length N. All paths are simple, thus may not pass through a given node more than once. This is essentially the definition of an (M, N)-transitive digraph. A natural question arises: Given a digraph, G, which may not be (M, N)-transitive, how may the minimum (or near minimum) number of edges be added to ensure that it has this property? (i. e. How may the (M, N)-transitive closure be computed?) An algorithm which answers this question for any digraph has been developed and is provided here, but the algorithm requires exponential time complexity in r, the number of nodes of the digraph. However, for many special cases (including, for any M and N, the computation of (M, 1)-transitive closures and all (M, N)-transitive closures on acyclic digraphs) more efficient, polynomial-time, specialized algorithms have been developed and are provided here. All algorithms have been implemented and tested using DEC Ada on a VAX8650. Comparative tests illustrating the time required to run each of the applicible algorithms have been run and the results are summarized." @default.
- W2279531134 created "2016-06-24" @default.
- W2279531134 creator A5029021812 @default.
- W2279531134 creator A5038032541 @default.
- W2279531134 date "1988-01-01" @default.
- W2279531134 modified "2023-09-23" @default.
- W2279531134 title "Optimizing subcase solutions for (M, N)-transitivity" @default.
- W2279531134 cites W1973860259 @default.
- W2279531134 cites W2027580688 @default.
- W2279531134 cites W2104734478 @default.
- W2279531134 doi "https://doi.org/10.1016/0895-7177(88)90627-9" @default.
- W2279531134 hasPublicationYear "1988" @default.
- W2279531134 type Work @default.
- W2279531134 sameAs 2279531134 @default.
- W2279531134 citedByCount "1" @default.
- W2279531134 crossrefType "journal-article" @default.
- W2279531134 hasAuthorship W2279531134A5029021812 @default.
- W2279531134 hasAuthorship W2279531134A5038032541 @default.
- W2279531134 hasConcept C105795698 @default.
- W2279531134 hasConcept C111472728 @default.
- W2279531134 hasConcept C11413529 @default.
- W2279531134 hasConcept C114614502 @default.
- W2279531134 hasConcept C118615104 @default.
- W2279531134 hasConcept C127413603 @default.
- W2279531134 hasConcept C128896722 @default.
- W2279531134 hasConcept C129691609 @default.
- W2279531134 hasConcept C132525143 @default.
- W2279531134 hasConcept C134306372 @default.
- W2279531134 hasConcept C138885662 @default.
- W2279531134 hasConcept C191399111 @default.
- W2279531134 hasConcept C199360897 @default.
- W2279531134 hasConcept C199622910 @default.
- W2279531134 hasConcept C203776342 @default.
- W2279531134 hasConcept C22149727 @default.
- W2279531134 hasConcept C2777735758 @default.
- W2279531134 hasConcept C2779145032 @default.
- W2279531134 hasConcept C2780586882 @default.
- W2279531134 hasConcept C311688 @default.
- W2279531134 hasConcept C33923547 @default.
- W2279531134 hasConcept C41008148 @default.
- W2279531134 hasConcept C45374587 @default.
- W2279531134 hasConcept C49937458 @default.
- W2279531134 hasConcept C62611344 @default.
- W2279531134 hasConcept C66938386 @default.
- W2279531134 hasConcept C90119067 @default.
- W2279531134 hasConceptScore W2279531134C105795698 @default.
- W2279531134 hasConceptScore W2279531134C111472728 @default.
- W2279531134 hasConceptScore W2279531134C11413529 @default.
- W2279531134 hasConceptScore W2279531134C114614502 @default.
- W2279531134 hasConceptScore W2279531134C118615104 @default.
- W2279531134 hasConceptScore W2279531134C127413603 @default.
- W2279531134 hasConceptScore W2279531134C128896722 @default.
- W2279531134 hasConceptScore W2279531134C129691609 @default.
- W2279531134 hasConceptScore W2279531134C132525143 @default.
- W2279531134 hasConceptScore W2279531134C134306372 @default.
- W2279531134 hasConceptScore W2279531134C138885662 @default.
- W2279531134 hasConceptScore W2279531134C191399111 @default.
- W2279531134 hasConceptScore W2279531134C199360897 @default.
- W2279531134 hasConceptScore W2279531134C199622910 @default.
- W2279531134 hasConceptScore W2279531134C203776342 @default.
- W2279531134 hasConceptScore W2279531134C22149727 @default.
- W2279531134 hasConceptScore W2279531134C2777735758 @default.
- W2279531134 hasConceptScore W2279531134C2779145032 @default.
- W2279531134 hasConceptScore W2279531134C2780586882 @default.
- W2279531134 hasConceptScore W2279531134C311688 @default.
- W2279531134 hasConceptScore W2279531134C33923547 @default.
- W2279531134 hasConceptScore W2279531134C41008148 @default.
- W2279531134 hasConceptScore W2279531134C45374587 @default.
- W2279531134 hasConceptScore W2279531134C49937458 @default.
- W2279531134 hasConceptScore W2279531134C62611344 @default.
- W2279531134 hasConceptScore W2279531134C66938386 @default.
- W2279531134 hasConceptScore W2279531134C90119067 @default.
- W2279531134 hasLocation W22795311341 @default.
- W2279531134 hasOpenAccess W2279531134 @default.
- W2279531134 hasPrimaryLocation W22795311341 @default.
- W2279531134 hasRelatedWork W1572529423 @default.
- W2279531134 hasRelatedWork W1579475208 @default.
- W2279531134 hasRelatedWork W1993815099 @default.
- W2279531134 hasRelatedWork W2048808499 @default.
- W2279531134 hasRelatedWork W2122976707 @default.
- W2279531134 hasRelatedWork W2279531134 @default.
- W2279531134 hasRelatedWork W2559091015 @default.
- W2279531134 hasRelatedWork W4297670176 @default.
- W2279531134 hasRelatedWork W90346837 @default.
- W2279531134 hasRelatedWork W3014978195 @default.
- W2279531134 hasVolume "11" @default.
- W2279531134 isParatext "false" @default.
- W2279531134 isRetracted "false" @default.
- W2279531134 magId "2279531134" @default.
- W2279531134 workType "article" @default.