Search results for "edge-cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
44	Monika Rauch Henzinger	Approximating Minimum Cuts under Insertions.	ICALP	1995	DBLP DOI BibTeX RDF
29	Ou Jianping, Fuji Zhang	Super Restricted Edge Connectivity of Regular Graphs.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	AMS Classification 05C40
28	Lap Chi Lau	An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40
28	Lap Chi Lau	An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem.	FOCS	2004	DBLP DOI BibTeX RDF
27	Gerhard Kramer, Serap A. Savari	Edge-Cut Bounds on Network Coding Rates.	J. Netw. Syst. Manag.	2006	DBLP DOI BibTeX RDF	d-separation, network coding, active networks, Network capacity
26	Josep Díaz, Fabrizio Grandoni 0001, Alberto Marchetti-Spaccamela	Balanced Cut Approximation in Random Geometric Graphs.	ISAAC	2006	DBLP DOI BibTeX RDF
24	Xianchao Zhang 0001, Weifa Liang, Guoliang Chen 0001	Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities.	COCOON	2008	DBLP DOI BibTeX RDF
20	A. Karygiannis, E. Antonakakis, A. Apostolopoulos	Detecting Critical Nodes for MANET Intrusion Detection Systems.	SecPerU	2006	DBLP DOI BibTeX RDF	edge-cut, vertex-cut, security, mobile ad hoc network, MANET, intrusion detection, IDS
20	Sung-Ho Woo, Sung-Bong Yang	An improved network clustering method for I/O-efficient query processing.	ACM-GIS	2000	DBLP DOI BibTeX RDF
19	Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.	CoRR	2022	DBLP BibTeX RDF
19	Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.	WG	2022	DBLP DOI BibTeX RDF
19	Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas	Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice.	SEA	2021	DBLP DOI BibTeX RDF
18	Martin Loebl	Efficient Maximal Cubic Graph Cuts (Extended Abstract).	ICALP	1991	DBLP DOI BibTeX RDF
18	Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization.	FSTTCS	1989	DBLP DOI BibTeX RDF
16	Henning Meyerhenke, Stefan Schamberger	Balancing Parallel Adaptive FEM Computations by Solving Systems of Linear Equations.	Euro-Par	2005	DBLP DOI BibTeX RDF
16	Stefan Schamberger	A Shape Optimizing Load Distribution Heuristic for Parallel Adaptive FEM Computations.	PaCT	2005	DBLP DOI BibTeX RDF
16	Kirk Schloegel, George Karypis, Vipin Kumar 0001	Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	Dynamic graph partitioning, multilevel diffusion, scratch-remap, wavefront diffusion, LMSR, adaptive mesh computations
16	Anna Moss, Yuval Rabani	Approximation algorithms for constrained for constrained node weighted steiner tree problems.	STOC	2001	DBLP DOI BibTeX RDF
15	Hong-Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou	Spanning Trails Connecting Given Edges.	Graphs Comb.	2005	DBLP DOI BibTeX RDF
15	Zdenek Dvorák 0001, Jan Kára, Daniel Král, Ondrej Pangrác	An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.	SWAT	2004	DBLP DOI BibTeX RDF
14	Chun-Hung Liu	A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF
14	Sergio Cabello, Kshitij Jain 0001, Anna Lubiw, Debajyoti Mondal	Minimum shared-power edge cut.	Networks	2020	DBLP DOI BibTeX RDF
14	Sergio Cabello, Kshitij Jain 0001, Anna Lubiw, Debajyoti Mondal	Minimum Shared-Power Edge Cut.	CoRR	2018	DBLP BibTeX RDF
14	Zhen-Mu Hong, Xinmin Hou, Jiaao Li, Yang Yang	A note on broom number and maximum edge-cut of graphs.	Ars Comb.	2017	DBLP BibTeX RDF
14	Martin Kochol	Edge cut splitting formulas for Tutte-Grothendieck invariants.	J. Comb. Theory, Ser. B	2017	DBLP DOI BibTeX RDF
14	Xiao Chen, Zhe-Ming Lu, Hong-Wa Yang, Gaofeng Pan	A New Approach to Constructing a Minimum Edge Cut Set Based on Maximum Flow.	J. Inf. Hiding Multim. Signal Process.	2015	DBLP BibTeX RDF
14	Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer	Reverse Edge Cut-Set Bounds for Secure Network Coding.	CoRR	2014	DBLP BibTeX RDF
14	Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer	Reverse edge cut-set bounds for secure network coding.	ISIT	2014	DBLP DOI BibTeX RDF
14	Jichang Wu, Jianping Ou	On Edge Cut of Graphs Leaving Components of Order at Least Five.	Graphs Comb.	2013	DBLP DOI BibTeX RDF
14	Sudeep U. Kamath, David N. C. Tse	On the Generalized Network Sharing bound and edge-cut bounds for network coding.	ISIT	2013	DBLP DOI BibTeX RDF
14	Sudeep Kamath, Pramod Viswanath	An information-theoretic meta-theorem on edge-cut bounds.	ISIT	2012	DBLP DOI BibTeX RDF
14	Denis Vanderstraeten, R. Keunings, Charbel Farhat	Beyond Conventional Mesh Partitioning Algorithms and the Minimum Edge Cut Criterion: Impact on Realistic Realistic Applications.	PPSC	1995	DBLP BibTeX RDF
13	Paul S. Bonsma	The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.	WG	2003	DBLP DOI BibTeX RDF
13	Gregory Wolfe, Jennifer L. Wong, Miodrag Potkonjak	Watermarking graph partitioning solutions.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2002	DBLP DOI BibTeX RDF
13	Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder	On Bounds for the k-Partitioning of Graphs.	COCOON	1999	DBLP DOI BibTeX RDF
13	Sergei L. Bezrukov	On k-Partitioning the n-Cube.	WG	1996	DBLP DOI BibTeX RDF
11	Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner	Planarity of the 2-Level Cactus Model.	WG	2001	DBLP DOI BibTeX RDF
8	Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald	A new diffusion-based multilevel algorithm for computing graph partitions of very high quality.	IPDPS	2008	DBLP DOI BibTeX RDF
8	Tianming Hu, Hui Xiong 0001, Wenjun Zhou 0001, Sam Yuan Sung, Hangzai Luo	Hypergraph partitioning for document clustering: a unified clique perspective.	SIGIR	2008	DBLP DOI BibTeX RDF	shared nearest neighbor, document clustering, clique, hypergraph partitioning
8	Chunjiang Wu, Shijie Zhou, Linna Wei, Jiaqing Luo, Yanli Wang, Xiaoqian Yang	A New k-Graph Partition Algorithm for Distributed P2P Simulation Systems.	ICA3PP	2007	DBLP DOI BibTeX RDF	Degree Sequence, P2P, Graph Partition, Distributed Simulation, Breadth-First Search
8	Henning Meyerhenke, Burkhard Monien, Stefan Schamberger	Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid.	IPDPS	2006	DBLP DOI BibTeX RDF
8	Yuichiro Hourai, Akira Nishida, Yoshio Oyanagi	Network-aware Data mMapping on Parallel Molecular Dynamicas.	ICPADS (1)	2005	DBLP DOI BibTeX RDF
8	Yonghui Chen, Alan P. Sprague	Exploration on the commonality of hierarchical clustering algorithms.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	data mining, clustering
8	Martin Kochol	A Theorem About Elementary Cuts and Flow Polynomials.	Graphs Comb.	2003	DBLP DOI BibTeX RDF	Nowhere-zero flow, (Integral) Flow polynomial, Equivalence classes of flows, Positive orientation of a nowhere-zero integral flow
8	Jörn Behrens, Jens Zimmermann	Parallelizing an Unstructured Grid Generator with a Space-Filling Curve Approach.	Euro-Par	2000	DBLP DOI BibTeX RDF
8	Kirk Schloegel, George Karypis, Vipin Kumar 0001	Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion.	Euro-Par	1997	DBLP DOI BibTeX RDF