New bounds on the size of the minimum feedback vertex set in meshes and butterflies

Authors:
Ioannis Caragiannis;Christos Kaklamanis;Panagiotis Kanellopoulos
Affiliations:
Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Patras, Greece;Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Patras, Greece;Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Patras, Greece
Venue:
Information Processing Letters
Year:
2002

Feedback vertex sets in star graphs

Information Processing Letters
New upper bounds on feedback vertex numbers in butterflies

Information Processing Letters
Feedback vertex sets in mesh-based networks

Theoretical Computer Science
An efficient algorithm for minimum feedback vertex sets in rotator graphs

Information Processing Letters
Feedback numbers of de Bruijn digraphs

Computers & Mathematics with Applications
Two hardness results on feedback vertex sets

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Tractable feedback vertex sets in restricted bipartite graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Dynamic monopolies and feedback vertex sets in hexagonal grids

Computers & Mathematics with Applications
Feedback vertex sets in rotator graphs

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Feedback vertex sets on restricted bipartite graphs

Theoretical Computer Science

Hi-index	0.89