Layered graphs: applications and algorithms
DOI10.3390/A11070093zbMATH Open1461.68148OpenAlexW2810208889WikidataQ129601946 ScholiaQ129601946MaRDI QIDQ2287476FDOQ2287476
Authors: Bhadrachalam Chitturi, Srijith Balachander, Sandeep Satheesh, Krithic Puthiyoppil 
Publication date: 21 January 2020
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a11070093
Recommendations
- On dominating set of some subclasses of string graphs
- On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
- On the parameterized complexity of layered graph drawing
- scientific article; zbMATH DE number 468640
- Serial and parallel algorithms for \((k,2)\)-partite graphs
dynamic programmingdominating setNP-completenessindependent setvertex coverlayered graphquasi-polynomial timestring transformations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Graph theory with applications
- Efficient algorithms for interval graphs and circular-arc graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Title not available (Why is that?)
- On maximal independent sets of vertices in claw-free graphs
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Dominating sets for split and bipartite graphs
- The complexity of comparability graph recognition and coloring
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- A linear algorithm for the domination number of a tree
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Algorithms for maximum independent sets
- Solving connected dominating set faster than \(2^n\)
- An optimal time algorithm for finding a maximum weight independent set in a tree
- Finding a Maximum Independent Set
- On the maximum independent set problem in subclasses of planar graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- A note on complexity of genetic mutations
- Adjacent Swaps on Strings
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
Cited In (5)
This page was built for publication: Layered graphs: applications and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287476)
