Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 140152

From MaRDI portal
Publication:4028537
Jump to:navigation, search

zbMATH Open0765.05087MaRDI QIDQ4028537FDOQ4028537


Authors: Alice A. McRae, Stephen T. Hedetniemi Edit this on Wikidata


Publication date: 28 March 1993



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



Recommendations

  • scientific article; zbMATH DE number 844146
  • A constructive characterization of trees with the same independent domination number.
  • On approximating the minimum independent dominating set
  • scientific article; zbMATH DE number 1389216
  • An algorithm to find two distance domination parameters in a graph


zbMATH Keywords

distancetreesNP-hardpolynomial algorithm\(n\)-independent dominating set


Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph theory (05C99)



Cited In (5)

  • Finding dominators via disjoint set union
  • On approximating the minimum independent dominating set
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Very cost effective bipartitions 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 Q4028537)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4028537&oldid=17742230"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 02:34. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki