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 6399334

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

zbMath1306.05158MaRDI QIDQ5173160

Uéverton dos Santos Souza, Maise Dantas da Silva, Fábio Protti

Publication date: 9 February 2015

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2683/0.html

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

zbMATH Keywords

computational complexitygraph algorithmscombinatorial gamesflood-itfree-flood-it


Mathematics Subject Classification ID

Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)


Related Items (7)

Unnamed Item ⋮ The Flood-It game parameterized by the vertex cover number ⋮ Efficient approaches for the flooding problem on graphs ⋮ A Survey on the Complexity of Flood-Filling Games ⋮ How Bad is the Freedom to Flood-It? ⋮ Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number ⋮ Tractability and hardness of flood-filling games on trees






This page was built for publication:

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