Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

Discrete and Computational Geometry - United States
doi 10.1007/s00454-008-9114-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Properties of Random Triangulations and Trees

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1999English

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

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

The Number of Disjoint Perfect Matchings in Semi-Regular Graphs

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1994English

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On Improving Matchings in Trees, via Bounded-Length Augmentations

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

The Number of Triangulations of the Cyclic Polytope C (N , N -4)

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2002English

Minimizing the Number of Actions in Parallel Planning

2010English

Trees With Given Maximum Degree Minimizing the Spectral Radius

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy