BIPARTITIONING INTO OVERLAPPING SETS

DOI10.1142/S0129054195000068MaRDI QIDQ4852316zbMATH OpenFDO

Authors James Haralambides, S. Tragoudas

Publication date 11 March 1996

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054195000068

zbMATH Keywords

hypertext partitioningmin-cut partitioning problemVLSI layout

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3131157
• Partitioning into sets of bounded cardinality
• Bipartizing with a matching
• Overpartition pairs
• Distinct partitions and overpartitions
• Set partitioning via inclusion-exclusion
• Bipartization of graphs
• Partitions of a segment into sets of the same type
• Partitioning Pairs of Countable Sets

Cited in

(4)

• scientific article; zbMATH DE number 3876616 (Why is no real title available?)
• Min-cut partitioning on underlying tree and graph structures
• Upper bounding overlaps by groupings
• A note on computing set overlap classes

This page was built for publication: BIPARTITIONING INTO OVERLAPPING SETS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852316)