Corpus ID: 59799554

Parallel computation of constrained spanning trees : heuristics and simd implementations

@inproceedings{Kumar1997ParallelCO,
  title={Parallel computation of constrained spanning trees : heuristics and simd implementations},
  author={Nishit Kumar},
  year={1997}
}
  • Nishit Kumar
  • Published 1997
  • Computer Science
  • Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED