Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.2012.11.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040446810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the differential of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for max independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching Trees: An Essay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum triangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fine-grained Analysis of a Simple Independent Set Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency in exponential time for domination-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enclaveless sets and MK-Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On feedback vertex sets and nonseparating independent sets in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toughness of split graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:21, 8 July 2024

scientific article
Language Label Description Also known as
English
Computing the differential of a graph: hardness, approximability and exact algorithms
scientific article

    Statements

    Computing the differential of a graph: hardness, approximability and exact algorithms (English)
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    differential of a graph
    0 references
    computational complexity
    0 references
    algorithms for NP hard problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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