The Set Connector Problem in Graphs

DOI10.1007/978-3-540-72792-7_36MaRDI QIDQ5429288zbMATH OpenOpenAlexFDO

Authors Takuro Fukunaga, Hiroshi Nagamochi

Publication date 29 November 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72792-7_36

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Set connectivity problems in undirected graphs and the directed Steiner network problem
• Set connectivity problems in undirected graphs and the directed Steiner network problem
• scientific article; zbMATH DE number 2197925
• scientific article; zbMATH DE number 3908486
• scientific article; zbMATH DE number 4104992
• The connected cutset connectivity of a graph
• An extremal problem on the connectivity of graphs
• \((1, j)\)-set problem in graphs
• Connected Set Cover Problem and Its Applications
• scientific article; zbMATH DE number 4012656

Cited in

(2)

• scientific article; zbMATH DE number 3910097 (Why is no real title available?)
• Graph orientations with set connectivity requirements

This page was built for publication: The Set Connector Problem in Graphs

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