On ideal semicomplete digraphs (Q2296276)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	On ideal semicomplete digraphs	scientific article

Statements

scholarly article

On ideal semicomplete digraphs (English)

Information Processing Letters

publication date

18 February 2020

zbMATH Keywords

combinatorial problems

hypergraph idealness

semicomplete digraphs

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ipl.2019.105903

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

A Min-Max Relation on Packing Feedback Vertex Sets

A Min-Max Theorem on Tournaments

An efficient algorithm for finding maximum cycle packings in reducible flow graphs

Packing cycles in graphs

Blocking and anti-blocking pairs of polyhedra

On the width-length inequality

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

Packing feedback arc sets in reducible flow graphs

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:2296276

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2296276&oldid=38993565"