Search results for "max-flow"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
53	Yasuhito Asano, Takao Nishizeki, Masashi Toyoda	Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework.	WISE	2005	DBLP DOI BibTeX RDF
48	Zhenjiang Li, Yao Yu, Xiaojun Hei, Danny H. K. Tsang	A Unified Framework for Sub-stream Scheduling in P2P Hybrid Streaming Systems and How to Do Better?.	Networking	2009	DBLP DOI BibTeX RDF	pull-push, max-flow, min-cost flow, hybrid, P2P streaming
43	Xijin Yan, Jun Yang, Zhen Zhang 0010	An outer bound for multisource multisink network coding with minimum cost consideration.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information
43	Jianmin Li, John Lillis, Chung-Kuan Cheng	Linear decomposition algorithm for VLSI design applications.	ICCAD	1995	DBLP DOI BibTeX RDF	linear placement, max-flow min-cut, eigenvector, circuit partitioning
41	Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman	Single source multiroute flows and cuts on uniform capacity networks.	SODA	2007	DBLP BibTeX RDF
41	Masilamani Vedhanayagam, Kamala Krithivasan	A Min-Cost-Max-Flow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images.	IWCIA	2008	DBLP DOI BibTeX RDF	binary matrix reconstruction, min cost integral max flow problem, computed tomography, discrete tomography
40	Yuri Boykov, Vladimir Kolmogorov	An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF
39	Xue-Bin Liang	Matrix games in the multicast networks: maximum information flows with network switching.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems
38	Joseph S. B. Mitchell	On Maximum Flows in Polyhedral Domains.	SCG	1988	DBLP DOI BibTeX RDF
38	Antonin Chambolle, Jérôme Darbon	On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows.	Int. J. Comput. Vis.	2009	DBLP DOI BibTeX RDF	Crystalline and anisotropic mean curvature flow, Max-flow/min-cut, Parametric max-flow algorithms, Total variation, Submodular functions, Variational approaches
37	José M. Bioucas-Dias, Gonçalo Valadão	Phase unwrapping: a new max-flow/min-cut based approach.	ICIP (2)	2005	DBLP DOI BibTeX RDF
37	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	J. ACM	2009	DBLP DOI BibTeX RDF	Edge-separator, single commodity max-flow, sparse cut, spectral method
37	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	STOC	2006	DBLP DOI BibTeX RDF	edge-separator, single commodity max-flow, sparse cut, spectral method
37	Frank Thomson Leighton, Satish Rao	An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms	FOCS	1988	DBLP DOI BibTeX RDF	max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation
36	Julia Chuzhoy, Sanjeev Khanna	Polynomial flow-cut gaps and hardness of directed cut problems.	STOC	2007	DBLP DOI BibTeX RDF	concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow
34	Chun-Gi Lyuh, Taewhan Kim	High-level synthesis for low power based on network flow method.	IEEE Trans. Very Large Scale Integr. Syst.	2003	DBLP DOI BibTeX RDF
33	Sourav Kumar Dandapat, Bivas Mitra, Niloy Ganguly, Romit Roy Choudhury	Fair bandwidth allocation in wireless network using max-flow.	SIGCOMM	2010	DBLP DOI BibTeX RDF	association control, max-flow, fairness
32	Yuri Boykov, Vladimir Kolmogorov	An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision.	EMMCVPR	2001	DBLP DOI BibTeX RDF
32	Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara	An approximation algorithm for the via placement problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
31	Austin Armbruster, Michael R. Gosnell, Bruce M. McMillin, Mariesa L. Crow	Power Transmission Control Using Distributed Max Flow.	COMPSAC (1)	2005	DBLP DOI BibTeX RDF	FT Algorithms, FT Communication, Fault Injection, maximum flow, power system
31	Maren Martens, S. Thomas McCormick	A Polynomial Algorithm for Weighted Abstract Flow.	IPCO	2008	DBLP DOI BibTeX RDF
27	Amir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak	All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time.	FOCS	2023	DBLP DOI BibTeX RDF
27	Yuanning Li, Yonghong Tian 0001, Jingjing Yang, Ling-Yu Duan, Wen Gao 0001	Video retargeting with multi-scale trajectory optimization.	Multimedia Information Retrieval	2010	DBLP DOI BibTeX RDF	max-flow/min-cut, multi-scale trajectory optimization, spatio-temporal saliency, video retargeting
27	Masilamani Vedhanayagam, Kamala Krithivasan, K. G. Subramanian 0001, Ang Miin Huey	Efficient Algorithms for Reconstruction of 2D-Arrays from Extended Parikh Images.	ISVC (2)	2008	DBLP DOI BibTeX RDF	Parikh mapping, extended Parikh mapping, Min-Cost Max-Flow problem, 2D-array reconstruction, Formal Languages
27	Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi	On partitioning graphs via single commodity flows.	STOC	2008	DBLP DOI BibTeX RDF	edge-separator, single-commodity max-flow, graph partitioning, spectral method, sparsest cut, matrix exponential
27	Ioannis C. Avramopoulos, Miltiades E. Anagnostou	Optimal Component Configuration and Component Routing.	IEEE Trans. Mob. Comput.	2002	DBLP DOI BibTeX RDF	component allocation, component mobility, multiterminal cuts, max flow—min cut, mixed binary integer programming, Mobile agents, reconfiguration, NP-hard problems
27	Man-Fai Yu, Joel Darnauer, Wayne Wei-Ming Dai	Interchangeable pin routing with application to package layout.	ICCAD	1996	DBLP DOI BibTeX RDF	BGA, all-angle wiring, interchangeable pin routing, min-cost max-flow heuristic, multiple layers, octilinear wiring, package layout, pin redistribution, prerouted nets, rectilinear wiring, test fixture routing, triangulated routing network, CAD, NP-complete, ASIC, circuit layout CAD, speed, PGA, input output, routing problems
27	Stavros G. Kolliopoulos, Clifford Stein 0001	Improved Approximation Algorithms for Unsplittable Flow Problems.	FOCS	1997	DBLP DOI BibTeX RDF
26	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	IPCO	2002	DBLP DOI BibTeX RDF
26	Hannah Honghua Yang, Martin D. F. Wong	Balanced partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
25	Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd	Non-Interfering Network Flows.	SWAT	1992	DBLP DOI BibTeX RDF
24	Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat	An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.	STOC	2007	DBLP DOI BibTeX RDF	Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut
24	Ana-Maria Popescu, Oren Etzioni, Henry A. Kautz	Towards a theory of natural language interfaces to databases.	IUI	2003	DBLP DOI BibTeX RDF	reliability, database, natural language interface
22	Timothy Gatzke, Cindy Grimm	Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm.	GMP	2006	DBLP DOI BibTeX RDF
22	S. A. Moghaddam, Nasser Masoumi, Caro Lucas	A Stochastic Power-Supply Noise Reduction Technique Using Max-Flow Algorithm and Decoupling Capacitance.	IWSOC	2005	DBLP DOI BibTeX RDF
22	Indra Geys, Thomas P. Koninckx, Luc Van Gool	Fast Interpolated Cameras by Combining a GPU based Plane Sweep with a Max-Flow Regularisation Algorithm.	3DPVT	2004	DBLP DOI BibTeX RDF
22	Monaldo Mastrolilli	Notes on Max Flow Time Minimization with Controllable Processing Times.	Computing	2003	DBLP DOI BibTeX RDF	Scheduling, approximation algorithms, parallel machines, controllable processing times
22	Monaldo Mastrolilli	Scheduling to Minimize Max Flow Time: Offline and Online Algorithms.	FCT	2003	DBLP DOI BibTeX RDF
22	Bertrand Guenin	A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property.	IPCO	2002	DBLP DOI BibTeX RDF
21	Satoru Iwata 0001, S. Thomas McCormick, Maiko Shigeno	A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.	IPCO	1999	DBLP DOI BibTeX RDF
20	Andrew V. Goldberg, Alexander V. Karzanov	Maximum skew-symmetric flows and matchings.	Math. Program.	2004	DBLP DOI BibTeX RDF	skew-symmetric graph, matching, network flow, b-matching
19	Xiaoqing Liu, Olga Veksler, Jagath Samarabandu	Order-Preserving Moves for Graph-Cut-Based Optimization.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	max-flow, geometric class labeling, SVM, Energy minimization, graph cuts, shape prior
19	Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin	Maximum Flow Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem
19	Franz-Josef Brandenburg, Mao-cheng Cai	Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.	FAW	2009	DBLP DOI BibTeX RDF	extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard
19	Hua Yu, Prasant Mohapatra, Xin Liu 0002	Channel Assignment and Link Scheduling in Multi-Radio Multi-Channel Wireless Mesh Networks.	Mob. Networks Appl.	2008	DBLP DOI BibTeX RDF	max-flow graph, linear programming, wireless mesh networks, interference, channel assignment, link scheduling
19	Vladimir Kolmogorov, Carsten Rother	Minimizing Nonsubmodular Functions with Graph Cuts-A Review.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	quadratic pseudo-Boolean optimization, min cut/max flow, texture restoration, Markov Random Fields, Energy minimization
19	Liang-Liang Xie, Panganamala R. Kumar	On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	capacity of wireless networks, cut-set bound, max-flow min-cut bound, multiuser information theory, ad hoc networks, wireless networks, scaling laws, transport capacity, network information theory
19	Jingtao Yu, Pingyi Fan, Kai Cai	Capacity analysis of maximal flow in ad hoc networks.	IWCMC	2006	DBLP DOI BibTeX RDF	max-flow min-cut, routing, network coding, random graph, network capacity
19	Georg Baier, Ekkehard Köhler, Martin Skutella	The k-Splittable Flow Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Max-flow min-cut, Approximation algorithm, Network flow, Unsplittable flow
19	Palash Sarkar 0001, Paul J. Schellenberg	Construction of Symmetric Balanced Squares with Blocksize More than One.	Des. Codes Cryptogr.	2003	DBLP DOI BibTeX RDF	symmetric Latin square, symmetric balanced square, min cut-max flow theorem, combinatorial design
19	Jon M. Kleinberg	Single-Source Unsplittable Flow.	FOCS	1996	DBLP DOI BibTeX RDF	max-flow min-cut, scheduling, load balancing, generalization, NP-hard, unsplittable flow, machine scheduling, capacity constraints
19	Sivan Toledo	Maximizing Non-Linear Concave Functions in Fixed Dimension	FOCS	1992	DBLP DOI BibTeX RDF	parametric Euclidean traveling salesman problem, fixed dimension, piece wise polynomial concave function, concave polynomial, input point, nonlinear parametric problems, parametric max flow problem, parametric minimum s-t distance, parametric spanning tree, NP-hard problems, convex set, arithmetic operations, polynomial functions
19	Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao	Approximation through Multicommodity Flow	FOCS	1990	DBLP DOI BibTeX RDF	minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
18	Pushmeet Kohli, Philip H. S. Torr	Dynamic Graph Cuts for Efficient Inference in Markov Random Fields.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	Dynamic graph cuts, st-mincut, Markov Random Fields, Energy Minimization, Video segmentation, Maximum flow
18	Joseph Cheriyan, Howard J. Karloff, Yuval Rabani	Approximating Directed Multicuts.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25
18	Pushmeet Kohli, Philip H. S. Torr	Effciently Solving Dynamic Markov Random Fields Using Graph Cuts.	ICCV	2005	DBLP DOI BibTeX RDF
18	Honghua Yang, D. F. Wong 0001	Efficient network flow based min-cut balanced partitioning.	ICCAD	1994	DBLP DOI BibTeX RDF
18	Claus-Peter Schnorr	Multiterminal Network Flow and Connectivity in Unsymmetrical Networks.	ICALP	1978	DBLP DOI BibTeX RDF
18	Juntong Luo, Scott Sallinen, Matei Ripeanu	Going with the Flow: Real-Time Max-Flow on Asynchronous Dynamic Graphs.	GRADES-NDA@SIGMOD	2023	DBLP DOI BibTeX RDF
18	Tao Zhang 0041, Hongyan Li 0001, Jiandong Li 0001, Shun Zhang 0003, Haiying Shen	A Dynamic Combined Flow Algorithm for the Two-Commodity Max-Flow Problem Over Delay-Tolerant Networks.	IEEE Trans. Wirel. Commun.	2018	DBLP DOI BibTeX RDF
18	Chin-Chia Jane, Yih-Wenn Laih	Distribution and reliability evaluation of max-flow in dynamic multi-state flow networks.	Eur. J. Oper. Res.	2017	DBLP DOI BibTeX RDF
18	Peter Lammich, S. Reza Sefidgar	Flow Networks and the Min-Cut-Max-Flow Theorem.	Arch. Formal Proofs	2017	DBLP BibTeX RDF
18	Guillaume Guex, François Bavaud	Flow-Based Dissimilarities: Shortest Path, Commute Time, Max-Flow and Free Energy.	ECDA	2013	DBLP DOI BibTeX RDF
18	Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi 0001	An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.	Comb.	1995	DBLP DOI BibTeX RDF
18	Hiroshi Nagamochi, Toshihide Ibaraki	On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
18	Klaus Truemper	Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes.	Math. Oper. Res.	1987	DBLP DOI BibTeX RDF
18	Richard G. Ogier	Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)		1985	RDF
17	Kazuo Iwama	Classic and Quantum Network Coding.	SWAT	2006	DBLP DOI BibTeX RDF
17	Sébastien Roy 0001, Venu Govindu	MRF Solutions for Probabilistic Optical Flow Formulations.	ICPR	2000	DBLP DOI BibTeX RDF
16	Toshihiko Horiike, Youhei Takahashi, Tetsuji Kuboyama, Hiroshi Sakamoto	Extracting Research Communities by Improved Maximum Flow Algorithm.	KES (2)	2009	DBLP DOI BibTeX RDF
16	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
16	Olivier Juan, Yuri Boykov	Capacity Scaling for Graph Cuts in Vision.	ICCV	2007	DBLP DOI BibTeX RDF
16	Dragan Petrovic, Kannan Ramchandran, Jan M. Rabaey	Overcoming untuned radios in wireless networks with network coding.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	untuned radios, sensor networks, network coding
16	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IbPRIA (1)	2005	DBLP DOI BibTeX RDF
16	Yan Feng, Dinesh P. Mehta, Hannah Honghua Yang	Constrained floorplanning using network flows.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2004	DBLP DOI BibTeX RDF
16	Yan Feng, Dinesh P. Mehta, Hannah Honghua Yang	Constrained "Modern" Floorplanning.	ISPD	2003	DBLP DOI BibTeX RDF	floorplanning, network flow, rectilinear polygons
16	Jittat Fakcharoenphol, Kunal Talwar	An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
16	David Hartvigsen	Generalized Max Flows and Augmenting Paths.	IPCO	1995	DBLP DOI BibTeX RDF
15	Huiqun Liu, Martin D. F. Wong	Network-flow-based multiway partitioning with area and pin constraints.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
14	Daniel Kosmas, Thomas C. Sharkey, John E. Mitchell 0001, Kayse Lee Maass, Lauren Martin	Multi-period max flow network interdiction with restructuring for disrupting domestic sex trafficking networks.	Ann. Oper. Res.	2024	DBLP DOI BibTeX RDF
14	G. Gayathri, Sunil Mathew, John N. Mordeson	Max-flow min-cut theorem for directed fuzzy incidence networks.	J. Appl. Math. Comput.	2024	DBLP DOI BibTeX RDF
14	Lorenzo Balzotti, Paolo Giulio Franciosa	How vulnerable is an undirected planar graph with respect to max flow.	Networks	2024	DBLP DOI BibTeX RDF
14	Matthew Broussard, Bala Krishnamoorthy	A tight max-flow min-cut duality theorem for nonlinear multicommodity flows.	J. Comb. Optim.	2024	DBLP DOI BibTeX RDF
14	Zhongtian He, Shang-En Huang, Thatchaphol Saranurak	Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts.	SODA	2024	DBLP DOI BibTeX RDF
14	Ohad Trabelsi	(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow.	CoRR	2023	DBLP DOI BibTeX RDF
14	Zhongtian He, Shang-En Huang, Thatchaphol Saranurak	Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts.	CoRR	2023	DBLP DOI BibTeX RDF
14	Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl	Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision.	IEEE Trans. Pattern Anal. Mach. Intell.	2023	DBLP DOI BibTeX RDF
14	Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar	Extreme Min - Cut Max - Flow Algorithm.	Int. J. Appl. Metaheuristic Comput.	2023	DBLP DOI BibTeX RDF
14	Ekaterina Merkurjev	Similarity graph-based max-flow and duality approaches for semi-supervised data classification and image segmentation.	Int. J. Mach. Learn. Cybern.	2023	DBLP DOI BibTeX RDF
14	Lorenzo Balzotti, Paolo Giulio Franciosa	How Vulnerable is an Undirected Planar Graph with Respect to Max Flow.	CIAC	2023	DBLP DOI BibTeX RDF
14	Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif	Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.	STOC	2023	DBLP DOI BibTeX RDF
14	Lorenzo Balzotti	Non-crossing shortest paths in planar graphs with applications to max flow, and path graphs.		2023	RDF
14	Sangita Dhara, Sujoy Ghose, Raja Datta	MFR - A Max-Flow-Based Routing for Future Interplanetary Networks.	IEEE Trans. Aerosp. Electron. Syst.	2022	DBLP DOI BibTeX RDF
14	Sicong Pan, Hui Wei 0001	A Global Max-Flow-Based Multi-Resolution Next-Best-View Method for Reconstruction of 3D Unknown Objects.	IEEE Robotics Autom. Lett.	2022	DBLP DOI BibTeX RDF
14	Yossi Peretz, Yigal Fischler	A fast parallel max-flow algorithm.	J. Parallel Distributed Comput.	2022	DBLP DOI BibTeX RDF
14	Giorgio Ausiello, Lorenzo Balzotti, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini	A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs.	CoRR	2022	DBLP DOI BibTeX RDF
14	Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl	Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision.	CoRR	2022	DBLP BibTeX RDF
14	Lorenzo Balzotti, Paolo Giulio Franciosa	Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs.	CoRR	2022	DBLP BibTeX RDF
14	Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif	Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
14	Moe Kayali, Dan Suciu	Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality.	CoRR	2022	DBLP DOI BibTeX RDF