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

Minimum connected dominating sets of intervals on lines

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

zbMATH Open1090.68083MaRDI QIDQ3373560FDOQ3373560


Authors: Junde Pi, Min Zhao, Liying Kang Edit this on Wikidata


Publication date: 13 March 2006





Recommendations

  • Minimum dominating sets of intervals on lines
  • On minimum intersection of two minimum dominating sets of interval graphs
  • A unified approach to domination problems on interval graphs
  • Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
  • Approximation algorithms for connected dominating sets


zbMATH Keywords

interval graphsconnected dominating sets


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)



Cited In (2)

  • Minimum Cell Connection in Line Segment Arrangements
  • Minimum dominating sets of intervals on lines





This page was built for publication: Minimum connected dominating sets of intervals on lines

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

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