Computing the All-Pairs Longest Chains in the Plane

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-57155-8_229
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees

2007English

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

An Optimal Algorithm for Computing Visibility in the Plane

SIAM Journal on Computing
MathematicsComputer Science
1995English

Computing All Pairs (Λ,μ) Such That Λ Is a Double Eigenvalue of A+μB

SIAM Journal on Matrix Analysis and Applications
Analysis
2011English

A GPU Implementation of a Bit-Parallel Algorithm for Computing the Longest Common Subsequence

IPSJ Online Transactions
2014English

Two-Dimensional Chains and the Associated Collineations in a Complex Plane

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1910English

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Harnessing Parallelism in Multicore Clusters With the All-Pairs and Wavefront Abstractions

2009English

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy