Computing mimicking networks
From MaRDI portal
Publication:1969941
DOI10.1007/S004539910003zbMATH Open0949.68166OpenAlexW3160409744MaRDI QIDQ1969941FDOQ1969941
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
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 (8)
- On mimicking networks representing minimum terminal cuts
- Improved guarantees for vertex sparsification in planar graphs
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Symbiotic Network Simulation and Emulation
- Faster algorithms for shortest path and network flow based on graph decomposition
- Worst-case ratios of networks in the rectilinear plane
- Tight Bounds for Gomory-Hu-like Cut Counting
- Refined vertex sparsifiers of planar 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)
