FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1778615931> ?p ?o ?g. }

• W1778615931 endingPage "1562" @default.
• W1778615931 startingPage "1552" @default.
• W1778615931 abstract "Many natural computational problems on graphs such as finding dominating or independent sets of a certain size are well known to be intractable, both in the classical sense as well as in the framework of parameterized complexity. Much work therefore has focussed on exhibiting restricted classes of graphs on which these problems become tractable. While in the case of undirected graphs, there is a rich structure theory which can be used to develop tractable algorithms for these problems on large classes of undirected graphs, such a theory is much less developed for directed graphs.Many attempts to identify structure properties of directed graphs tailored towards algorithmic applications have focussed on a directed analogue of undirected tree-width. These attempts have proved to be successful in the development of algorithms for linkage problems but none of the existing width-measures allow for tractable solutions to important problems such as dominating sets and many other related problems.In this paper we take a radically different approach to identifying classes of directed graphs where domination and other problems become tractable. In particular, whereas most existing approaches treat the class of acyclic graphs as simple in their respective width measure, we will specifically study classes of digraphs which do not contain all acyclic digraphs. It is this new approach that make the algorithmic results reported herein possible.More specifically, we introduce the concept of shallow directed minors and based on this a new classification of classes of directed graphs which is diametric to existing directed graph decompositions and directed width measures proposed in the literature.We then study in depth one type of classes of directed graphs which we call nowhere crownful. The classes are very general as they include, on the one hand, all classes of directed graphs whose underlying undirected class is nowhere dense, such as planar, bounded-genus, and H-minor-free graphs; and on the other hand, also contain classes of high edge density whose underlying class is not nowhere dense. Yet we are able to show that problems such as directed dominating set and many others become fixed-parameter tractable on nowhere crownful classes of directed graphs. This is of particular interest as these problems are not tractable on any existing digraph measure for sparse classes.The algorithmic results are established via proving a structural equivalence of nowhere crownful classes and classes of graphs which are directed uniformly quasi-wide. While this result is inspired by [Nesetril and Ossona de Mendez 2008], their proof method does not extend to the directed case and a different and much more involved proof is needed, turning it into a particularly significant part of our contribution." @default.
• W1778615931 created "2016-06-24" @default.
• W1778615931 creator A5062011497 @default.
• W1778615931 creator A5065411002 @default.
• W1778615931 date "2012-01-17" @default.
• W1778615931 modified "2023-10-02" @default.
• W1778615931 title "Directed nowhere dense classes of graphs" @default.
• W1778615931 cites W1487444734 @default.
• W1778615931 cites W1507214855 @default.
• W1778615931 cites W1537449969 @default.
• W1778615931 cites W1538293711 @default.
• W1778615931 cites W1570425181 @default.
• W1778615931 cites W1587767312 @default.
• W1778615931 cites W1750706066 @default.
• W1778615931 cites W1967565181 @default.
• W1778615931 cites W1976676758 @default.
• W1778615931 cites W1980240005 @default.
• W1778615931 cites W1994264784 @default.
• W1778615931 cites W2007627758 @default.
• W1778615931 cites W2049229625 @default.
• W1778615931 cites W2054167510 @default.
• W1778615931 cites W2057826895 @default.
• W1778615931 cites W2063554572 @default.
• W1778615931 cites W2087083200 @default.
• W1778615931 cites W2090787331 @default.
• W1778615931 cites W2099898495 @default.
• W1778615931 cites W2105793991 @default.
• W1778615931 cites W2118722432 @default.
• W1778615931 cites W2155539817 @default.
• W1778615931 cites W2163940503 @default.
• W1778615931 cites W2241818993 @default.
• W1778615931 cites W27200453 @default.
• W1778615931 cites W2798588639 @default.
• W1778615931 cites W2913688336 @default.
• W1778615931 cites W2914617426 @default.
• W1778615931 cites W2949612215 @default.
• W1778615931 cites W2986773320 @default.
• W1778615931 cites W36639738 @default.
• W1778615931 cites W92405270 @default.
• W1778615931 doi "https://doi.org/10.5555/2095116.2095239" @default.
• W1778615931 hasPublicationYear "2012" @default.
• W1778615931 type Work @default.
• W1778615931 sameAs 1778615931 @default.
• W1778615931 citedByCount "7" @default.
• W1778615931 countsByYear W17786159312012 @default.
• W1778615931 countsByYear W17786159312014 @default.
• W1778615931 countsByYear W17786159312015 @default.
• W1778615931 countsByYear W17786159312018 @default.
• W1778615931 countsByYear W17786159312020 @default.
• W1778615931 countsByYear W17786159312023 @default.
• W1778615931 crossrefType "proceedings-article" @default.
• W1778615931 hasAuthorship W1778615931A5062011497 @default.
• W1778615931 hasAuthorship W1778615931A5065411002 @default.
• W1778615931 hasConcept C111472728 @default.
• W1778615931 hasConcept C11413529 @default.
• W1778615931 hasConcept C114614502 @default.
• W1778615931 hasConcept C132525143 @default.
• W1778615931 hasConcept C138885662 @default.
• W1778615931 hasConcept C146380142 @default.
• W1778615931 hasConcept C154945302 @default.
• W1778615931 hasConcept C160446614 @default.
• W1778615931 hasConcept C165464430 @default.
• W1778615931 hasConcept C187407849 @default.
• W1778615931 hasConcept C203776342 @default.
• W1778615931 hasConcept C2777212361 @default.
• W1778615931 hasConcept C2780586882 @default.
• W1778615931 hasConcept C3018234147 @default.
• W1778615931 hasConcept C33923547 @default.
• W1778615931 hasConcept C41008148 @default.
• W1778615931 hasConcept C43517604 @default.
• W1778615931 hasConcept C74133993 @default.
• W1778615931 hasConcept C74197172 @default.
• W1778615931 hasConcept C80444323 @default.
• W1778615931 hasConceptScore W1778615931C111472728 @default.
• W1778615931 hasConceptScore W1778615931C11413529 @default.
• W1778615931 hasConceptScore W1778615931C114614502 @default.
• W1778615931 hasConceptScore W1778615931C132525143 @default.
• W1778615931 hasConceptScore W1778615931C138885662 @default.
• W1778615931 hasConceptScore W1778615931C146380142 @default.
• W1778615931 hasConceptScore W1778615931C154945302 @default.
• W1778615931 hasConceptScore W1778615931C160446614 @default.
• W1778615931 hasConceptScore W1778615931C165464430 @default.
• W1778615931 hasConceptScore W1778615931C187407849 @default.
• W1778615931 hasConceptScore W1778615931C203776342 @default.
• W1778615931 hasConceptScore W1778615931C2777212361 @default.
• W1778615931 hasConceptScore W1778615931C2780586882 @default.
• W1778615931 hasConceptScore W1778615931C3018234147 @default.
• W1778615931 hasConceptScore W1778615931C33923547 @default.
• W1778615931 hasConceptScore W1778615931C41008148 @default.
• W1778615931 hasConceptScore W1778615931C43517604 @default.
• W1778615931 hasConceptScore W1778615931C74133993 @default.
• W1778615931 hasConceptScore W1778615931C74197172 @default.
• W1778615931 hasConceptScore W1778615931C80444323 @default.
• W1778615931 hasLocation W17786159311 @default.
• W1778615931 hasOpenAccess W1778615931 @default.
• W1778615931 hasPrimaryLocation W17786159311 @default.
• W1778615931 hasRelatedWork W10105891 @default.
• W1778615931 hasRelatedWork W132145278 @default.

• next