Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time.
Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time.
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
\(P_8\)-free graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Analysis of algorithms and problem complexity, Graph algorithms (graph-theoretic aspects), dominating induced matching, polynomial time algorithm, efficient edge domination, Dominating induced matching; Efficient edge domination; P-8-free graphs; Polynomial time algorithm
\(P_8\)-free graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Analysis of algorithms and problem complexity, Graph algorithms (graph-theoretic aspects), dominating induced matching, polynomial time algorithm, efficient edge domination, Dominating induced matching; Efficient edge domination; P-8-free graphs; Polynomial time algorithm
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).0 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!