Computing mimicking networks

DOI10.1007/S004539910003MaRDI QIDQ1969941zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 March 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004539910003

zbMATH Keywords

mimicking network

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2186281
• scientific article; zbMATH DE number 2009862
• scientific article; zbMATH DE number 4098738
• scientific article; zbMATH DE number 4203687
• Computing in dynamic networks
• scientific article; zbMATH DE number 3903985
• Simulation of large networks on smaller networks
• scientific article; zbMATH DE number 4026814
• Cellular automaton modeling of computer network

Cited in

(11)

• Characterizing multiterminal flow networks and computing flows in networks of small treewidth
• On mimicking networks representing minimum terminal cuts
• Worst-case ratios of networks in the rectilinear plane
• Tight Bounds for Gomory-Hu-like Cut Counting
• NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
• Refined vertex sparsifiers of planar graphs
• Improved guarantees for vertex sparsification in planar graphs
• Faster algorithms for shortest path and network flow based on graph decomposition
• Symbiotic Network Simulation and Emulation
• The Even-Path problem in directed single-crossing-minor-free graphs
• Nearly-tight bounds for flow sparsifiers in quasi-bipartite graphs

This page was built for publication: Computing mimicking networks

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