On the edge-independence number and edge-covering number for regular graphs
type: Item
instance of: scholarly article
title: On the edge-independence number and edge-covering number for regular graphs
zbMATH Open document ID: 0804.90134
author: Michail M. Kovalev
author: A. V. Moshchenskij
published in: Discrete Mathematics and Applications
publication date: 1995-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 707532
zbMATH Keywords: real order-convex function
zbMATH Keywords: gradient
zbMATH Keywords: deciphering problem
zbMATH Keywords: monotonous Boolean function
zbMATH Keywords: upper bound
zbMATH Keywords: complexity estimate
MaRDI profile type: Publication
full work available at URL: dma.1992.2.1.1
OpenAlex ID: W2089257943
DOI: 10.1515/DMA.1992.2.1.1
Recommended article: Q5202042
Recommended article: Q3477901
Recommended article: Q3217952
Recommended article: Q3727272
Recommended article: Approximately optimal algorithms for determining extrema in a certain class of functions
Recommended article: Q3812043
Recommended article: Optimal extremum-search algorithms for differentiable functions
Recommended article: Q3340643
Recommended article: Approximating optimization problems over convex functions
Recommended article: Optimal Search for the Global Maximum of Functions with Bounded Seminorm
description: scientific article; zbMATH DE number 707532