Concepedia

Efficient algorithms for Roman domination on some classes of graphs

Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng‐Lung Peng

Discrete Applied Mathematics · 2008 · 63 citations · 11 references

DOI

Concepts

References

11

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

B. Courcelle, Johann A. Makowsky, Udi Rotics · Theory of Computing Systems · 2000 · 788 citations

, , +14

Upper bounds to the clique width of graphs

Bruno Courcelle, Stephan Olariu · Discrete Applied Mathematics · 2000 · 632 citations

, , +5

Roman domination in graphs

E. J. Cockayne, Paul Dreyer, Sandra M. Hedetniemi et al. · Discrete Mathematics · 2003 · 556 citations

, , +9

Defend the Roman Empire!

Ian Stewart · Scientific American · 1999 · 359 citations

, , +8

Defendens Imperium Romanum: A Classical Problem in Military Strategy

Charles ReVelle, Kenneth E. Rosing · American Mathematical Monthly · 2000 · 168 citations

, , +13