Minimal feedback vertex sets in directed split‐stars

DOI10.1002/net.20067zbMath1065.05088OpenAlexW4254703335MaRDI QIDQ5463673

Jen-Chih Tsai, Fu-Hsing Wang, Cheng-Ju Hsu

Publication date: 5 August 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20067

zbMATH Keywords

interconnection networksdistributed algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

The decycling number of $P_{m} \square P_{n}^{\ast}$ ⋮ Feedback numbers of Kautz digraphs ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ On the decycling number of generalized Kautz digraphs ⋮ Conditional matching preclusion for the alternating group graphs and split-stars ⋮ MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS ⋮ Feedback numbers of de Bruijn digraphs ⋮ A note on leader election in directed split-stars and directed alternating group graphs ⋮ An efficient distributed algorithm for canonical labeling on directed split-stars

Cites Work

• Unnamed Item

This page was built for publication: Minimal feedback vertex sets in directed split‐stars