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:3549695
Jump to:navigation, search

zbMath1231.68284MaRDI QIDQ3549695

Bundit Laekhanukit, Jittat Fakcharoenphol

Publication date: 5 January 2009


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


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)


Related Items (7)

Sparse certificates for 2-connectivity in directed graphs ⋮ Survivable network activation problems ⋮ Approximating minimum-cost edge-covers of crossing biset-families ⋮ Pruning 2-connected graphs ⋮ An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity ⋮ Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ Approximating minimum-power edge-covers and 2,3-connectivity




This page was built for publication:

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