✦ LIBER ✦

Efficient algorithms for some path partitioning problems

✍ Scribed by Peter Brucker

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 471 KB
Volume: 62
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00146-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for path partitions

✍ Craig Williams; Dana Richards 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 763 KB

Efficient heuristic algorithms for path-

Efficient heuristic algorithms for path-based hardware/software partitioning

✍ Jigang Wu; Thambipillai Srikanthan; Ting Lei 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Efficient dynamic algorithms for some ge

Efficient dynamic algorithms for some geometric intersection problems

✍ Siu Wing Cheng; Ravi Janardan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 705 KB

An efficient algorithm for the complete

An efficient algorithm for the complete set partitioning problem

✍ Chien-Hua M. Lin; Harvey M. Salkin 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 439 KB

Efficient algorithm for graph-partitioni

Efficient algorithm for graph-partitioning problem using a problem transformation method

✍ C.-H. Lee; C.-I. Park; M. Kim 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 717 KB

Algorithms for the minimum partitioning

Algorithms for the minimum partitioning problems in graphs

✍ Hiroshi Nagamochi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen