scientific article; zbMATH DE number 7310218

MaRDI QIDQ5150592

A. R. Urakov, T. V. Timeryaev

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm427

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph partitioningsparse graphsgraph approximationproblem complexity reduction

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Balanced graph partitioning
• Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
• An Efficient Heuristic Procedure for Partitioning Graphs

This page was built for publication: