How to tidy up a symmetric set-system by use of uncrossing operations
type: Item
instance of: scholarly article
title: How to tidy up a symmetric set-system by use of uncrossing operations
zbMATH Open document ID: 0868.90139
DOI: 10.1016/0304-3975(95)00160-3
author: Alexander V. Karzanov
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 984412
zbMATH Keywords: cut packing problem
zbMATH Keywords: crossing sets
zbMATH Keywords: uncrossing
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00160-3
OpenAlex ID: W2061549332
cites work: Q4149476
cites work: Matching, Euler tours and the Chinese postman
cites work: Geometric algorithms and combinatorial optimization
cites work: Q5519709
cites work: Q3977426
cites work: Q3683847
cites work: On Odd Cuts and Plane Multicommodity Flows
Recommended article: Uncrossing a family of set-pairs
Recommended article: Symmetric Unions Without Cosmetic Crossing Changes
Recommended article: Unifying the representation of symmetric crossing families and weakly partitive families
Recommended article: On symmetric equivalence of symmetric union diagrams
Recommended article: Cross-intersecting families and primitivity of symmetric systems
Recommended article: Idempotent totally symmetric operations on finite posets
Recommended article: Existence of symmetric maximal noncrossing collections of \(k\)-element sets
Recommended article: A New Approach to Cross-Bifix-Free Sets
Recommended article: Symmetry and Satisfiability: An Update
Recommended article: Notions of symmetry in set theory with classes
description: scientific article; zbMATH DE number 984412