FRINK Linked Data Fragments server

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

• W3211992564 abstract "Author(s): havvaei, elham | Advisor(s): Eppstein, David | Abstract: Parameterized complexity provides an important framework to deal with hard problems by restricting some problem parameter to be a fixed constants. Problems which are categorized as fixed-parameter tractable with respect to some parameters are problems that can be solved in polynomial time, if such parameters are bounded by a fixed value.In this dissertation, in Chapter 2, we first study the problem of recognizing k-leaf powers and representing k-leaf roots. A graph G is a k-leaf power of a tree if its vertices correspond to leaves of the tree and a pair of leaves have distance at most k if and only if the corresponding vertices in G are adjacent. Then, the tree is a k-leaf root of G. A graph is a k-leaf power if it has at least one k-leaf root. We show recognizing k-leaf powers parameterized by k and the degeneracy of the input graph is fixed parameter tractable. This is the first result in the literature studying this problem in the paradigm of parameterized complexity and providing a polynomial-time algorithm working on multiple values of k.Following this line of work, in Chapter 3, we study the parameterized complexity of the problem of finding induced subgraphs with hereditary properties under the condition that the input graph belongs to a hereditary graph class, as well. In this work, we provide a framework that settles the parameterized complexity of various graph classes.To show the importance of graph representation, we emphasize that our proposed technique for recognition of k-leaf powers for graphs of bounded degeneracy heavily relies on our representation of k-leaf roots as a subgraph of the graph product of the input graph and a cycle graph of size k. Additionally, in Chapter 4, we study the problem of simplifying activity-on-edge graphs, which provides an insight on how graph representation can further help data analysis such as enabling a better understanding of the flow of project schedules. In an activity-on-edge graph, vertices represent project milestones and edges represent the tasks/activities of the project. We simplify such representations of project schedules to enhance visualization of an abstract timeline of the potential critical paths of the project by optimally minimizing the number of vertices while maintaining the reachability relations among tasks." @default.
• W3211992564 created "2021-11-22" @default.
• W3211992564 creator A5081369407 @default.
• W3211992564 date "2021-01-01" @default.
• W3211992564 modified "2023-09-26" @default.
• W3211992564 title "Parameterization and Concise Representation in Graph Algorithms: Leaf powers, Subgraphs with Hereditary Properties, and Activity-on-edge Minimization" @default.
• W3211992564 hasPublicationYear "2021" @default.
• W3211992564 type Work @default.
• W3211992564 sameAs 3211992564 @default.
• W3211992564 citedByCount "0" @default.
• W3211992564 crossrefType "journal-article" @default.
• W3211992564 hasAuthorship W3211992564A5081369407 @default.
• W3211992564 hasConcept C114614502 @default.
• W3211992564 hasConcept C118615104 @default.
• W3211992564 hasConcept C132525143 @default.
• W3211992564 hasConcept C134306372 @default.
• W3211992564 hasConcept C165464430 @default.
• W3211992564 hasConcept C2777727622 @default.
• W3211992564 hasConcept C311688 @default.
• W3211992564 hasConcept C33923547 @default.
• W3211992564 hasConcept C34388435 @default.
• W3211992564 hasConcept C60644358 @default.
• W3211992564 hasConcept C86803240 @default.
• W3211992564 hasConceptScore W3211992564C114614502 @default.
• W3211992564 hasConceptScore W3211992564C118615104 @default.
• W3211992564 hasConceptScore W3211992564C132525143 @default.
• W3211992564 hasConceptScore W3211992564C134306372 @default.
• W3211992564 hasConceptScore W3211992564C165464430 @default.
• W3211992564 hasConceptScore W3211992564C2777727622 @default.
• W3211992564 hasConceptScore W3211992564C311688 @default.
• W3211992564 hasConceptScore W3211992564C33923547 @default.
• W3211992564 hasConceptScore W3211992564C34388435 @default.
• W3211992564 hasConceptScore W3211992564C60644358 @default.
• W3211992564 hasConceptScore W3211992564C86803240 @default.
• W3211992564 hasLocation W32119925641 @default.
• W3211992564 hasOpenAccess W3211992564 @default.
• W3211992564 hasPrimaryLocation W32119925641 @default.
• W3211992564 hasRelatedWork W1485295947 @default.
• W3211992564 hasRelatedWork W1516590160 @default.
• W3211992564 hasRelatedWork W1520824195 @default.
• W3211992564 hasRelatedWork W1529545264 @default.
• W3211992564 hasRelatedWork W1533217239 @default.
• W3211992564 hasRelatedWork W171389261 @default.
• W3211992564 hasRelatedWork W2016465035 @default.
• W3211992564 hasRelatedWork W2037512951 @default.
• W3211992564 hasRelatedWork W2039453926 @default.
• W3211992564 hasRelatedWork W2081921897 @default.
• W3211992564 hasRelatedWork W2186663447 @default.
• W3211992564 hasRelatedWork W2523666425 @default.
• W3211992564 hasRelatedWork W2542138745 @default.
• W3211992564 hasRelatedWork W2609477008 @default.
• W3211992564 hasRelatedWork W2950378209 @default.
• W3211992564 hasRelatedWork W2965843841 @default.
• W3211992564 hasRelatedWork W3022854747 @default.
• W3211992564 hasRelatedWork W3109737810 @default.
• W3211992564 hasRelatedWork W3116738772 @default.
• W3211992564 hasRelatedWork W61434062 @default.
• W3211992564 isParatext "false" @default.
• W3211992564 isRetracted "false" @default.
• W3211992564 magId "3211992564" @default.
• W3211992564 workType "article" @default.