✦ LIBER ✦

An algorithm for vertex detection

✍ Scribed by S. Anand; S. Raman; R.A. Wysk

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 900 KB
Volume: 14
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(88)90016-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved vertex enumeration algorithm

✍ M.E. Dyer; L.G. Proll 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

An improved fixed-parameter algorithm fo

An improved fixed-parameter algorithm for vertex cover

✍ R. Balasubramanian; Michael R. Fellows; Venkatesh Raman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 546 KB

The VERTEX COVER problem asks, for input consisting of a graph G on n vertices, and a positive integer k, whether there is a set of k vertices such that every edge of G is incident with at least one of these vertices. We give an algorithm for this problem that runs in time O(kn + (1.324718)'k'). In

An Efficient Exact Algorithm for Constra

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

✍ Henning Fernau; Rolf Niedermeier 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 382 KB

The constraint bipartite vertex cover problem (CBVC for short) is as follows: given a bipartite graph G with n vertices and two positive integers k 1 k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It fo

A fast algorithm for vertex estimation

✍ E. Calligarich; R. Dolfini; M. Genoni; A. Rotondi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 516 KB

An O(¦V¦ ∗ ¦E¦) algorithm for finding im

An O(¦V¦ ∗ ¦E¦) algorithm for finding immediate multiple-vertex dominators

✍ Stephen Alstrup; Jens Clausen; Kristian Jørgensen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 201 KB

A Static 2-Approximation Algorithm for V

A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity

✍ Monika Rauch Henzinger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. Ž . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge