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 ℓ ,...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 84; no. 9; pp. 2767 - 2784
Main Authors:	Bang-Jensen, Jørgen, Eiben, Eduard, Gutin, Gregory, Wahlström, Magnus, Yeo, Anders
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2022 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!