Publication:3999535

zbMath0732.05001MaRDI QIDQ3999535

Witold jun. Lipski

Publication date: 17 September 1992

zbMATH Keywords

algorithms; computational complexity; algorithmic approach to combinatorial problems

Mathematics Subject Classification ID

05C90: Applications of graph theory

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics

Related Items

Minimal enumerations of subsets of a finite set and the middle level problem, The gold partition conjecture for 6-thin posets, Construction of simple path graphs in transport networks. I: General solutions and examples, Symmetric information exchange system based on ring isomorphism, Parallelizing a new algorithm for the set partition problem