Rounding in symmetric matrices and undirected graphs

DOI10.1016/0166-218X(96)81476-4zbMath0920.05062WikidataQ127344036 ScholiaQ127344036MaRDI QIDQ1923592

Brenda Li, Pavol Hell, David G. Kirkpatrick

Publication date: 9 October 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

symmetric matricesroundinggraph factors

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Graph factors and factorization: 1985--2003: a survey ⋮ Matrix approximation and Tusnády's problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Matching theory
• Simplified existence theorems for \((g,f)\)-factors
• A remark on the existence of finite graphs
• Matrices of zeros and ones
• Packings by Complete Bipartite Graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• The NP-Completeness of Some Edge-Partition Problems
• Controlled Rounding
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• Degree-Constrained Network Spanners with Nonconstant Delay
• An algorithmic proof of Tutte's f-factor theorem
• Dividing a graph by degrees

This page was built for publication: Rounding in symmetric matrices and undirected graphs