Abstract: In this paper we deal a classical problem, degree restricted spanning trees for series-parallel graph. Our general goal is to prove the NP-completeness of restricted degree spanning trees ...

Abstract: The minimum edge-ranking spanning tree (MERST) problem on a graph is to find a spanning tree of G whose edge-ranking needs least number of ranks. Although polynomial-time algorithm to solve ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

Victor Lee is director of product management at TigerGraph. Graph databases excel at answering complex questions about relationships in large data sets. But they hit a wall—in terms of both ...

A startup named TigerGraph emerged from stealth today with a new native parallel graph database that its founder thinks can shake up the analytics market. With $31 million in venture funding and ...