An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem

SIAM Journal on Computing - United States
doi 10.1137/0222068
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation

SIAM Journal on Scientific and Statistical Computing
1992English

An O(N Log N) Algorithm for Shape Modeling.

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1996English

The Degree/Diameter Problem in Maximal Planar Bipartite Graphs

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

An O(log N) Dynamic Router-Table Design

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2004English

A Near-Linear Algorithm for the Planar Segment-Center Problem

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1996English

An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

Journal of Computer Science and Technology
HardwareComputer Science ApplicationsArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2012English

An Ω(n2 Log N) Lower Bound to the Shortest Paths Problem

1977English

An Efficient Least Common Subgraph Algorithm for Video Indexing

English

Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets

BRICS Report Series
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy