Into the square: on the complexity of some quadratic-time solvable problems (Q737085): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2016.03.005 / rank
Normal rank
 
Property / author
 
Property / author: Michel A. Habib / rank
Normal rank
 
Property / author
 
Property / author: Michel A. Habib / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113317700 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1499093134 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1407.4972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of Faster Alignment of Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic algorithms for 3SUM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Into the square: on the complexity of some quadratic-time solvable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Gromov Hyperbolicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the diameter of real-world undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Subset Partial Order: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threesomes, Degenerates, and Love Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding orthogonal vectors in discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolicity and chordality of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding extremal sets in less than quadratic time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENTCS.2016.03.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:32, 10 December 2024

scientific article
Language Label Description Also known as
English
Into the square: on the complexity of some quadratic-time solvable problems
scientific article

    Statements

    Into the square: on the complexity of some quadratic-time solvable problems (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2016
    0 references
    quadratic-time algorithms
    0 references
    reductions
    0 references
    strong exponential-time hypothesis
    0 references
    transitive closure
    0 references
    0 references
    0 references
    0 references

    Identifiers