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

Graph-Theoretic Concepts in Computer Science

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

DOI10.1007/11604686zbMATH Open1126.68513MaRDI QIDQ5897541FDOQ5897541


Authors: Divesh Aggarwal, Shashank K. Mehta, Jitender Deogun Edit this on Wikidata


Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)





Recommendations

  • On the domination search number
  • scientific article; zbMATH DE number 1696531
  • Extremal problems for game domination number
  • Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
  • Approximation algorithms for domination search


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)



Cited In (4)

  • An annotated bibliography on guaranteed graph searching
  • On the domination search number
  • Title not available (Why is that?)
  • Approximation algorithms for domination search





This page was built for publication: Graph-Theoretic Concepts in Computer Science

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

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