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 ℓ 1 and ℓ 2 , one on each. A bipartite permutation graph is a permutation graph which is bipartite. In this paper we study the parameterized complexity of the bipartite permutation verte...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 84; číslo 8; s. 2271 - 2291
Hlavní autori:	Bożyk, Łukasz, Derbisz, Jan, Krawczyk, Tomasz, Novotná, Jana, Okrasa, Karolina
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2022 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Graph theory Graphs Mathematics of Computing Permutations Polynomials Special Issue: Parameterized and Exact Computation (IPEC 2020) Theory of Computation Graph modification problems Partially ordered set Permutation graphs Comparability graphs
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!