Component Order Connectivity in Directed Graphs

A directed graph D is semicomplete if for every pair x , y of vertices of D , there is at least one arc between x and y . Thus, a tournament is a semicomplete digraph. In the Directed Component Order Connectivity (DCOC) problem, given a digraph D = ( V , A ) and a pair of natural numbers k and ℓ ,...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 84; číslo 9; s. 2767 - 2784
Hlavní autoři:	Bang-Jensen, Jørgen, Eiben, Eduard, Gutin, Gregory, Wahlström, Magnus, Yeo, Anders
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2022 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Apexes Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Feedback Graph theory Graphs Mathematics of Computing Number theory Parameters Special Issue: Parameterized and Exact Computation (IPEC 2020) Theory of Computation Upper bounds Vertex sets Parameterized Complexity Order connectivity Strong connectivity Directed graph
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!