Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 1124601

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

zbMath0896.05054MaRDI QIDQ4378629

Dieter Kratsch

Publication date: 31 March 1998


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveydominating setdominationdomination algorithms


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (6)

On dominating sets whose induced subgraphs have a bounded diameter ⋮ An exact algorithm for the minimum dominating clique problem ⋮ Improved algorithms and complexity results for power domination in graphs ⋮ Algorithms for dominating clique problems ⋮ D?E?K=(1000)8 ⋮ Improved bottleneck domination algorithms






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4378629&oldid=18382649"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 00:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki