Parameterized computational complexity of finding small-diameter subgraphs (Q1758028): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Alexander Schaefer / rank
Normal rank
 
Property / author
 
Property / author: Alexander Schaefer / 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/s11590-011-0311-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051438793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalitions and payoffs in three‐person sequential games: Initial tests of two formal models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Diameter-Bounded Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for finding \(k\)-clubs in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the longest isometric cycle in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the maximum diameter ratio of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:05, 5 July 2024

scientific article
Language Label Description Also known as
English
Parameterized computational complexity of finding small-diameter subgraphs
scientific article

    Statements

    Parameterized computational complexity of finding small-diameter subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2012
    0 references
    0 references
    clique relaxation
    0 references
    \(s\)-club
    0 references
    NP-hard problem
    0 references
    problem kernel
    0 references
    polynomial-time preprocessing
    0 references
    branching algorithm
    0 references
    0 references