On directed covering and domination problems (Q1735678): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128580590, #quickstatements; #temporary_batch_1723902436788
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2908576804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge Hamiltonian path problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dag-width of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some properties of DNA graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in quasi-adjoint graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Problems in Nowhere-Dense Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Sparseness: the case of Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: edge dominating set: Efficient Enumeration-Based Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph width measures in parameterized algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of line digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-cyclic Orientations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face covers and the genus problem for apex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128580590 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:54, 17 August 2024

scientific article
Language Label Description Also known as
English
On directed covering and domination problems
scientific article

    Statements

    On directed covering and domination problems (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    directed graph
    0 references
    vertex cover
    0 references
    dominating set
    0 references
    edge dominating set
    0 references
    fixed-parameter algorithms
    0 references
    0 references
    0 references