Computing the all-pairs longest chains in the plane (Q5060093): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mikhail J. Atallah / rank
Normal rank
 
Property / author
 
Property / author: Mikhail J. Atallah / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-57155-8_229 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1583932855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New clique and independent set algorithms for circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for String Editing and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel rectilinear shortest paths with rectangular obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some modified algorithms for Dijkstra's longest upsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some beautiful arguments using mathematical induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the length of longest increasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum cliques in circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:46, 31 July 2024

scientific article; zbMATH DE number 7643366
Language Label Description Also known as
English
Computing the all-pairs longest chains in the plane
scientific article; zbMATH DE number 7643366

    Statements

    Computing the all-pairs longest chains in the plane (English)
    0 references
    0 references
    0 references
    18 January 2023
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references