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

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

zbMath0974.68540MaRDI QIDQ2753956

Konstantin Skodinis

Publication date: 11 November 2001


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


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (6)

Linear-time algorithms for problems on planar graphs with fixed disk dimension ⋮ Combining intensification and diversification strategies in VNS. An application to the vertex separation problem ⋮ Variable neighborhood search for the vertex separation problem ⋮ Computing the vertex separation of unicyclic graphs ⋮ Distributed chasing of network intruders ⋮ Neighbourhood-width of trees




This page was built for publication:

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