On the typical case complexity of graph optimization (Q2581548): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.dam.2005.05.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133404696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]<sup><i>d</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Plane Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Intersection Graphs: The Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The small-world phenomenon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest edge of the random minimal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Latest revision as of 14:56, 11 June 2024

scientific article
Language Label Description Also known as
English
On the typical case complexity of graph optimization
scientific article

    Statements

    On the typical case complexity of graph optimization (English)
    0 references
    10 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Typical case complexity
    0 references
    Nonuniform polynomial time algorithm
    0 references
    Graph optimization
    0 references
    Concentration of hardness
    0 references
    0 references
    0 references