𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A local algorithm for finding dense subgraphs

✍ Scribed by Andersen, Reid

Book ID
121207097
Publisher
Association for Computing Machinery
Year
2010
Tongue
English
Weight
119 KB
Volume
6
Category
Article
ISSN
1549-6325

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Greedily Finding a Dense Subgraph
Greedily Finding a Dense Subgraph
✍ Yuichi Asahiro; Kazuo Iwama; Hisao Tamaki; Takeshi Tokuyama πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 144 KB

Given an n-vertex graph with nonnegative edge weights and a positive integer k F n, our goal is to find a k-vertex subgraph with the maximum weight. We study the following greedy algorithm for this problem: repeatedly remove a vertex with the minimum weighted-degree in the currently remaining graph,

A Better Approximation Algorithm for Fin
A Better Approximation Algorithm for Finding Planar Subgraphs
✍ Gruia CΔƒlinescu; Cristina G Fernandes; Ulrich Finkler; Howard Karloff πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 321 KB

The MAXIMUM PLANAR SUBGRAPH problemᎏgiven a graph G, find a largest planar subgraph of Gᎏhas applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1r3,

Faster algorithms for finding and counti
Faster algorithms for finding and counting subgraphs
✍ Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman; Saket Saurabh; B.V. Raghaven πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 210 KB