Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
type: Item
instance of: scholarly article
title: Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
zbMATH Open document ID: 1236.05063
DOI: 10.1134/S0032946011030057
author: T. A. Urbanovich
author: Maxim Babenko
published in: Problems of Information Transmission
publication date: 2012-03-13T00:00:00Z
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6014364
zbMATH Keywords: almost \(d\)-regular graphs
MaRDI profile type: Publication
cites work: Q5572939
cites work: Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Regular subgraphs of almost regular graphs
Recommended article: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
Recommended article: A linear algorithm for the maximal planar subgraph problem
Recommended article: On linear algebraic algorithms for the subgraph matching problem and its variants
Recommended article: A Linear Time Algorithm for Determining Almost Bipartite Graphs
Recommended article: Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Recommended article: A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
Recommended article: A linear time algorithm for finding maximal planar subgraphs
Recommended article: Q4763401
Recommended article: Computing Minimal Spanning Subgraphs in Linear Time
Recommended article: Linear algorithm for domatic number problem on interval graphs
description: scientific article; zbMATH DE number 6014364