Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number
Copyright policy )Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Salento Italy
- University of Chieti-Pescara Italy
Extremal problems in graph theory, maximum matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, maximum stable set, polynomial time algorithm, Maximum stable set; Maximum matching; Polynomial time algorithm, Maximum matching; Maximum stable set; Polynomial time algorithm; Discrete Mathematics and Combinatorics; Theoretical Computer Science
Extremal problems in graph theory, maximum matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, maximum stable set, polynomial time algorithm, Maximum stable set; Maximum matching; Polynomial time algorithm, Maximum matching; Maximum stable set; Polynomial time algorithm; Discrete Mathematics and Combinatorics; Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!