Optimal Bichromatic Plane Spanning Trees for Special Point Sets

doi 10.22215/etd/2017-11859
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Carleton University

Related search

A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Separating Bichromatic Point Sets by Two Disjoint Isothetic Rectangles

Scientia Iranica
2016English

Optimal Ventcel Graphs, Minimal Cost Spanning Trees and Asymptotic Probabilities

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2007English

Certain Theorems Relating to Plane Connected Point Sets

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1922English

Visibility Graphs of Point Sets in the Plane

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2008English

Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1997English

Concerning Point Sets With a Special Connectedness Property

Colloquium Mathematicum
Mathematics
1968English

Further Inequalities for Convex Sets With Lattice Point Constraints in the Plane

Bulletin of the Australian Mathematical Society
Mathematics
1980English

Concerning Point Sets With a Special Connectedness Property, II

Colloquium Mathematicum
Mathematics
1970English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy