scientific article; zbMATH DE number 2080194

MaRDI QIDQ4472436zbMATH OpenFDO

Authors Sachin Patkar, H. Narayanan

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1974/19740094.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
• Optimal attack and reinforcement of a network
• Network reinforcement
• A faster algorithm for computing the principal sequence of partitions of a graph
• scientific article; zbMATH DE number 56092

Cited in

(3)

• Improving graph partitions using submodular functions.
• Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
• Optimal attack and reinforcement of a network

This page was built for publication:

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