Decompositions of a Set Into Disjoint Pairs

Fundamenta Mathematicae - Poland
doi 10.4064/fm-41-2-278-283
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Mathematics, Polish Academy of Sciences

Related search

Boolean Function Representation Based on Disjoint-Support Decompositions

English

Disjoint Set Union With Randomized Linking

2013English

Polarized Pairs, Log Minimal Models, and Zariski Decompositions

Nagoya Mathematical Journal
Mathematics
2014English

Decomposition of a Graph Into Two Disjoint Odd Subgraphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2018English

Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Efficient Heuristics for Determining Node-Disjoint Path Pairs Visiting Specified Nodes

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2017English

On Decompositions of a Multi-Graph Into Spanning Subgraphs

Bulletin of the American Mathematical Society
1974English

A Fast Approximation of the Voronoi Diagram for a Set of Pairwise Disjoint Arcs

2018English

Direct Decompositions Into Infinitely Many Summands

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1948English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy