scientific article; zbMATH DE number 4119945

MaRDI QIDQ4733671zbMATH OpenFDO

Authors Alexander Schrijver

Publication date 1989

zbMATH Keywords

polynomial timestrong connectivity problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 867714
• The connectivity of strongly regular graphs
• On the strong Arnol'd hypothesis and the connectivity of graphs
• (Strong) conflict-free connectivity: algorithm and complexity
• A conjecture concerning strongly connected graphs
• An extremal problem on the connectivity of graphs
• On the maximum connectivity improvement problem
• scientific article; zbMATH DE number 4150206
• On (strong) proper vertex-connection of graphs
• On the complexity of two circle strongly connecting problems

Cited in

(1)

• The connected critical node problem

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 Q4733671)