Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
From MaRDI portal
Publication:1286282
DOI10.1007/BF02911265zbMath0936.68077MaRDI QIDQ1286282
Publication date: 3 May 1999
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- LUCAS. Associative array processor. Design, programming and application studies
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- STAR -- a language for associative and parallel computation with vertical processing
- Optimal representation of the minimum spanning tree algorithm in associative parallel processors
- Efficient algorithms for a family of matroid intersection problems
- A good algorithm for smallest spanning trees with a degree constraint
This page was built for publication: Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
