Maximal irredundant functions

DOI10.1016/0166-218X(95)00071-XzbMath0858.05059OpenAlexW2089594258MaRDI QIDQ1923617

Yanyan Li

Publication date: 23 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00071-x

zbMATH Keywords

polynomial-time algorithmirredundanceirredundance numberclosed neighbourhoodirredundant functions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The Private Neighbor Concept

Cites Work

• On the computational complexity of upper fractional domination
• Fractional matchings and the Edmonds-Gallai theorem
• Fractional matchings and covers in infinite hypergraphs
• Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition
• Packing Problems and Hypergraph Theory: A Survey
• Properties of Hereditary Hypergraphs and Middle Graphs
• Linear-time computation of optimal subgraphs of decomposable graphs
• On the Fractional Covering Number of Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal irredundant functions