Search results for "edge-connectivity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
12	Weifa Liang, Hong Shen	Fully dynamic maintaining 2-edge connectivity in parallel.	SPDP	1995	DBLP DOI BibTeX RDF
12	Toshiya Mashima, Toshimasa Watanabe	Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem.	ISCAS	1995	DBLP DOI BibTeX RDF
12	John Hershberger 0001, Monika Rauch, Subhash Suri	Data Structures for Two-Edge Connectivity in Planar Graphs.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
12	Dingjun Lou, Derek A. Holton	Lower bound of cyclic edge connectivity for n-extendability of regular graphs.	Discret. Math.	1993	DBLP DOI BibTeX RDF
12	David W. Matula	A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity.	SODA	1993	DBLP DOI BibTeX RDF
12	Shi-Nine Yang, M.-S. Cheng	Distributed Algorithms on Edge Connectivity Problems.	SPDP	1993	DBLP DOI BibTeX RDF
12	András Frank	Augmenting Graphs to Meet Edge-Connectivity Requirements.	SIAM J. Discret. Math.	1992	DBLP DOI BibTeX RDF
12	Sunil Chopra	Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems.	SIAM J. Discret. Math.	1992	DBLP DOI BibTeX RDF
12	Hiroshi Nagamochi, Toshihide Ibaraki	Computing Edge-Connectivity in Multigraphs and Capacitated Graphs.	SIAM J. Discret. Math.	1992	DBLP DOI BibTeX RDF
12	Terunao Soneoka	Super Edge-Connectivity of Dense Digraphs and Graphs.	Discret. Appl. Math.	1992	DBLP DOI BibTeX RDF
12	Zvi Galil, Giuseppe F. Italiano	Fully Dynamic Algorithms for 2-Edge Connectivity.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
12	Robert E. L. Aldred, Derek A. Holton, Bill Jackson	Uniform cyclic edge connectivity in cubic graphs.	Comb.	1991	DBLP DOI BibTeX RDF
12	Dalit Naor, Vijay V. Vazirani	Representing and Enumerating Edge Connectivity Cuts in RNC.	WADS	1991	DBLP DOI BibTeX RDF
12	Zvi Galil, Giuseppe F. Italiano	Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract)	STOC	1991	DBLP DOI BibTeX RDF
12	Harold N. Gabow	A Matroid Approach to Finding Edge Connectivity and Packing Arborescences	STOC	1991	DBLP DOI BibTeX RDF
12	Hiroshi Nagamochi, Toshihide Ibaraki	Computing Edge-Connectivity in Multiple and Capacitated Graphs.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
12	Linda M. Lesniak, Raymond E. Pippert	On the edge-connectivity vector of a graph.	Networks	1989	DBLP DOI BibTeX RDF
12	Yishay Mansour, Baruch Schieber	Finding the Edge Connectivity of Directed Graphs.	J. Algorithms	1989	DBLP DOI BibTeX RDF
12	Lutz Volkmann	Edge-connectivity in p-partite graphs.	J. Graph Theory	1989	DBLP DOI BibTeX RDF
12	Abdol-Hossein Esfahanian, S. Louis Hakimi	On Computing a Conditional Edge-Connectivity of a Graph.	Inf. Process. Lett.	1988	DBLP DOI BibTeX RDF
12	Yahya Ould Hamidoune, Michel Las Vergnas	Local edge-connectivity in regular bipartite graphs.	J. Comb. Theory, Ser. B	1988	DBLP DOI BibTeX RDF
12	Toshimasa Watanabe, Akira Nakamura	Edge-Connectivity Augmentation Problems.	J. Comput. Syst. Sci.	1987	DBLP DOI BibTeX RDF
12	Haruko Okamura	Paths and edge-connectivity in graphs III. Six-terminalk paths.	Graphs Comb.	1987	DBLP DOI BibTeX RDF
12	David W. Matula	Determining Edge Connectivity in O(nm)	FOCS	1987	DBLP DOI BibTeX RDF
12	Wolfgang Mader 0001	Paths in graphs, reducing the edge-connectivity only by two.	Graphs Comb.	1985	DBLP DOI BibTeX RDF
12	Haruko Okamura	Paths and edge-connectivity in graphs.	J. Comb. Theory, Ser. B	1984	DBLP DOI BibTeX RDF
12	Béla Bollobás	On graphs with equal edge connectivity and minimum degree.	Discret. Math.	1979	DBLP DOI BibTeX RDF
12	Claus-Peter Schnorr	Bottlenecks and Edge Connectivity in Unsymmetrical Networks.	SIAM J. Comput.	1979	DBLP DOI BibTeX RDF
12	Donald L. Goldsmith, Roger C. Entringer	A sufficient condition for equality of edge-connectivity and minimum degree of a graph.	J. Graph Theory	1979	DBLP DOI BibTeX RDF
12	Donald L. Goldsmith, Arthur T. White	On graphs with equal edge-connectivity and minimum degree.	Discret. Math.	1978	DBLP DOI BibTeX RDF
12	Robert E. Bixby	The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds.	Networks	1975	DBLP DOI BibTeX RDF
12	Linda M. Lesniak	Results on the edge-connectivity of graphs.	Discret. Math.	1974	DBLP DOI BibTeX RDF
12	Vance Faber, Jan Mycielski	Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth.	Discret. Math.	1973	DBLP DOI BibTeX RDF
12	Sameera Poduri, Sundeep Pattem, Bhaskar Krishnamachari, Gaurav S. Sukhatme	Using Local Geometry for Tunable Topology Control in Sensor Networks.	IEEE Trans. Mob. Comput.	2009	DBLP DOI BibTeX RDF
12	Sushant Patnaik, Neil Immerman	Dyn-FO: A Parallel, Dynamic Complexity Class.	PODS	1994	DBLP DOI BibTeX RDF
11	Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwan Krunz	Single-link failure detection in all-optical networks using monitoring cycles and paths.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	fault localization, all-optical networks
11	Alessandro Ferrante, Mimmo Parente	An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.	ICTCS	2003	DBLP DOI BibTeX RDF
11	Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe	A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph.	ISCAS (3)	2003	DBLP DOI BibTeX RDF
11	Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan	Computing Minimal Spanning Subgraphs in Linear Time.	SODA	1992	DBLP BibTeX RDF
7	Stefan Dobrev, Rastislav Kralovic, Dana Pardubská	Leader Election in Extremely Unreliable Rings and Complete Networks.	OPODIS	2008	DBLP DOI BibTeX RDF
7	Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen	Mixed Models for the Analysis of Local Search Components.	SLS	2007	DBLP DOI BibTeX RDF
7	Dongfang Zhao 0001, Li Yang	Incremental Construction of Neighborhood Graphs for Nonlinear Dimensionality Reduction.	ICPR (3)	2006	DBLP DOI BibTeX RDF
7	Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro	On Fractional Dynamic Faults with Threshold.	SIROCCO	2006	DBLP DOI BibTeX RDF
7	Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi	Bisecting a Four-Connected Graph with Three Resource Sets.	ISAAC	2005	DBLP DOI BibTeX RDF
7	Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige	Minimizing a Monotone Concave Function with Laminar Covering Constraints.	ISAAC	2005	DBLP DOI BibTeX RDF
7	Piotr Krysta	Bicriteria Network Design via Iterative Rounding.	COCOON	2005	DBLP DOI BibTeX RDF
7	Andrew B. Kahng, Bao Liu 0001, Ion I. Mandoiu	Nontree routing for reliability and yield improvement [IC layout].	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2004	DBLP DOI BibTeX RDF
7	Anna de Mier, Marc Noy	On Graphs Determined by Their Tutte Polynomials.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
7	Michael Brinkmeier	Communities in Graphs.	IICS	2003	DBLP DOI BibTeX RDF
7	Ken Museth, David E. Breen, Ross T. Whitaker, Alan H. Barr	Level set surface editing operators.	ACM Trans. Graph.	2002	DBLP DOI BibTeX RDF	geometric modeling, deformations, implicit surfaces, shape blending
7	Ali Karci	New Interconnection Networks: Fibonacci Cube and Extended Fibonacci Cubes Based Hierarchic Networks.	ICOIN	2001	DBLP DOI BibTeX RDF	Hierarchical Interconnection Networks, Extended Fibonacci Cubes, Interconnection Networks, Hypercubes, Fibonacci Cubes
7	Chung Ming Kuo, Chaur-Heh Hsieh, Yong Ren Huang, Zen Sun Lo	A New Mesh-Based Temporal-Spatial Segmentation for Image Sequence.	COMPSAC	2000	DBLP DOI BibTeX RDF	Clique potential, Video segmentation, MAP, Video-object, Gibbs distribution
7	Hiroshi Nagamochi, Toshihide Ibaraki	Polyhedral Structure of Submodular and Posi-modular Systems.	ISAAC	1998	DBLP DOI BibTeX RDF
7	Edson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song	Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.	ICALP	1997	DBLP DOI BibTeX RDF
7	Claus-Peter Schnorr	Multiterminal Network Flow and Connectivity in Unsymmetrical Networks.	ICALP	1978	DBLP DOI BibTeX RDF