Cargando…
Vertex Deletion into Bipartite Permutation Graphs
A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines [Formula: see text] and [Formula: see text] , one on each. A bipartite permutation graph is a permutation graph which is bipartite. In this paper we study the parameterized complexity of...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9304081/ https://www.ncbi.nlm.nih.gov/pubmed/35880199 http://dx.doi.org/10.1007/s00453-021-00923-7 |