We introduce a new class of planar graphs called triangle graphs. First, we present a formal way of constructing and characterizing triangle graphs, and then show that they characterize theâ€¦ (More)

In this paper, we are going to examine the problem of optimal file allocation In arbitrary computer networks This problem has been shown to be NP-complete [CHAHD76, ESWAR74] Several authors TCHU69,â€¦ (More)

This paper concentrates on the prediction problem of evolving graphs. We provide five new models and methods for prediction problem of evolving graphs. We experiment each method on real-worldâ€¦ (More)

have made some important observations about the degree-bounds on digraphs for the Hamiltonian cycle problem to be NP. complete. In this note, we show that their degree-bounds can be modified to yieldâ€¦ (More)

Consider solving linear elliptic partial di erential systems on shared memory parallel comput ers with mesh generation and adaptive mesh re nement utilizing an underlying quadtree structure for dataâ€¦ (More)