On Tree-Constrained Matchings and Generalizations

Algorithmica - United States
doi 10.1007/s00453-013-9785-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On the Number of $F$-Matchings in a Tree

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

On Stable Matchings and Flows

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2014English

Chance Constrained Spanning Tree Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1981English

Tree Growth Modelling Constrained by Growth Equations

Computer Graphics Forum
Computer NetworksComputer GraphicsComputer-Aided DesignCommunications
2017English

Matchings and Hadwiger's Conjecture

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2002English

Independent Sets, Matchings, and Occupancy Fractions

Journal of the London Mathematical Society
Mathematics
2017English

{New Results Relating Independence and Matchings

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Farsightedly Stable Matchings

SSRN Electronic Journal
2012English

On Tall Cardinals and Some Related Generalizations

Israel Journal of Mathematics
Mathematics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy