scientific article

zbMATH Open0581.05029MaRDI QIDQ3703920

V. E. Majstrenko

Publication date: 1983

Title of this publication is not available (Why is that?)

zbMATH Keywords

Dijkstra's algorithmminimal dominating setsrecognition objects

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A method of determining extremal subgraphs 👍 👎
• A polynomial-time approximation to a minimum dominating set in a graph 👍 👎
• A general method in the theory of domination in graphs 👍 👎
• Algorithmic Aspect of Minus Domination on Small-Degree Graphs 👍 👎
• Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs 👍 👎
• A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS 👍 👎
• An algebraic approach to sets defining minimal dominating sets of regular graphs 👍 👎
• An iterated greedy algorithm for finding the minimum dominating set in graphs 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703920)