Search results for "connected-components"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
82	Alberto Biancardi, Manuel Segovia-Martínez	Adaptive Segmentation of MR Axial Brain Images Using Connected Components.	IWVF	2001	DBLP DOI BibTeX RDF	connected filters, brain segmentation, magnetic resonance imaging (MRI), Connected components, medical image analysis
59	Nicolas Neubauer 0001, Klaus Obermayer	Hyperincident connected components of tagging networks.	Hypertext	2009	DBLP DOI BibTeX RDF	tagging, connected components, spam detection
51	Stavros D. Nikolopoulos, Leonidas Palios	Adding an Edge in a Cograph.	WG	2005	DBLP DOI BibTeX RDF	cotrees, co-connected components, optimization problems, connected components, Perfect graphs, cographs
50	Warren Schudy	Finding strongly connected components in parallel using o(log2n) reachability queries.	SPAA	2008	DBLP DOI BibTeX RDF	transitive closure bottleneck, parallel algorithms, graph algorithms, strongly connected components, topological sort
50	Jia-Ping Wang	Stochastic Relaxation on Partitions With Connected Components and Its Application to Image Segmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	1998	DBLP DOI BibTeX RDF	multiscale segmentation, simulated annealing, Connected components, unsupervised segmentation, Gibbs distribution, hierarchical segmentation
45	Robert G. Abbott, Lance R. Williams	Multiple target tracking with lazy background subtraction and connected components analysis.	Mach. Vis. Appl.	2009	DBLP DOI BibTeX RDF	Segmentation, Background subtraction, Connected components analysis
45	Christopher T. Johnston, Donald G. Bailey	FPGA implementation of a Single Pass Connected Components Algorithm.	DELTA	2008	DBLP DOI BibTeX RDF	FPGA, Image Segmentation, Stream Processing, Connected Components Analysis
45	Jop F. Sibeyn	External Connected Components.	SWAT	2004	DBLP DOI BibTeX RDF	External Algorithms, Tree Rooting, Connected Components, List Ranking, Graph Problems
45	David A. Bader, Joseph F. JáJá	Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract).	PPoPP	1995	DBLP DOI BibTeX RDF	scalable parallel processing, parallel algorithms, image processing, histogramming, connected components, image understanding
45	Jaekyu Ha, Robert M. Haralick, Ihsin T. Phillips	Recursive X-Y cut using bounding boxes of connected components.	ICDAR	1995	DBLP DOI BibTeX RDF	recursive X-Y cut, top-down page segmentation technique, rectangular blocks, Sparc-10 workstations, letter-sized document images, image segmentation, document image processing, connected components, document image, bounding boxes, image pixels
43	Lifeng He, Yuyan Chao, Kenji Suzuki 0001	A Run-Based Two-Scan Labeling Algorithm.	ICIAR	2007	DBLP DOI BibTeX RDF	label equivalence, run data, pattern recognition, connected components, linear-time algorithm, Labeling algorithm
41	Nicolas Neubauer 0001, Robert Wetzker, Klaus Obermayer	Tag spam creates large non-giant connected components.	AIRWeb	2009	DBLP DOI BibTeX RDF	tagging, connected components, spam detection
40	Emma E. Regentova, Shahram Latifi, Shulan Deng, Dongsheng Yao	An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images.	IEEE Trans. Pattern Anal. Mach. Intell.	2002	DBLP DOI BibTeX RDF	CCITT (ITU) Group 3/4 compression, MH/MR/MMR, connected components, Document image
40	Per Gunnar Auran, Kjell E. Malvig	Real-time Extraction of connected Components in 3-D Sonar Range Images.	CVPR	1996	DBLP DOI BibTeX RDF	3-D spatial image formation, segmentation, connected components analysis
37	Pranay Chaudhuri	An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components.	Computing	1999	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C85, 68Q22, 68Q25, 68Q10
35	David A. Bader, Joseph F. JáJá, David Harwood, Larry S. Davis	Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study.	IPPS	1996	DBLP DOI BibTeX RDF	Symmetric Neighborhood Filter, Parallel Algorithms, Image Processing, Image Segmentation, Image Enhancement, Region Growing, Connected Components, Parallel Performance
35	Philippe Jacquet, Bernard Mans	Routing in Intermittently Connected Networks: Age Rumors in Connected Components.	PerCom Workshops	2007	DBLP DOI BibTeX RDF
35	Costantino Grana, Daniele Borghesani, Paolo Santinelli, Rita Cucchiara	High Performance Connected Components Labeling on FPGA.	DEXA Workshops	2010	DBLP DOI BibTeX RDF	FPGA, system on chip, CMOS image sensor, connected components labeling
35	Seyed Jalal Kazemitabar, Hamid Beigy	Using Strongly Connected Components as a Basis for Autonomous Skill Acquisition in Reinforcement Learning.	ISNN (1)	2009	DBLP DOI BibTeX RDF	hierarchical reinforcement learning, strongly connected components, skill acquisition
35	Donald B. Johnson 0001, Panagiotis Takis Metaxas	Connected Components in O(\lg^3/2 \|V\|) Parallel Time for the CREW PRAM	FOCS	1991	DBLP DOI BibTeX RDF	CREW processors, parallel time, edges, connected components, vertices, undirected graph, CREW PRAM
35	Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen	On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	Ackermann function inverse, four-connected components, k-connectivity query, static data structure, online updates, triconnected graphs, graph, edges, vertices, dynamic data structure, disjoint paths
34	Amitava Datta	Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System.	J. Supercomput.	2002	DBLP DOI BibTeX RDF	reconfigurable pipelined bus, minimum spanning forest, parallel algorithm, graph algorithms, connected components, optical computing, biconnected components
34	Alina N. Moga, Moncef Gabbouj	Parallel Image Component Labeling With Watershed Transformation.	IEEE Trans. Pattern Anal. Mach. Intell.	1997	DBLP DOI BibTeX RDF	image segmentation, parallel computing, efficient algorithms, connected components, Watersheds
32	Laurent D. Cohen, Thomas Deschamps	Grouping connected components using minimal path techniques. Application to reconstruction of vessels in 2D and 3D images.	CVPR (2)	2001	DBLP DOI BibTeX RDF
32	Philippe Salembier, Henri Sanson	Robust Motion Estimation Using Connected Operators.	ICIP (1)	1997	DBLP DOI BibTeX RDF	connected operators, robust motion estimation, dominant motion extraction, filtering step, motion-oriented segmentation, individual connected components, motion estimation, image sequences, iteration, frame
31	James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook	A Functional Approach to External Graph Algorithms.	Algorithmica	2002	DBLP DOI BibTeX RDF	Functional programming, Graph algorithms, Minimum spanning trees, Connected components, External memory algorithms, Maximal independent sets, Maximal matchings
31	Yuri Boykov, Olga Veksler, Ramin Zabih	Disparity Component Matching for Visual Correspondence.	CVPR	1997	DBLP DOI BibTeX RDF	motion, Stereo, maximum likelihood, correspondence, connected components
31	Konstantin Zuyev	Table Image Segmentation.	ICDAR	1997	DBLP DOI BibTeX RDF	Table image segmentation, table grid, connected components, projection profile
30	Yang Wang 0004, Prabir Bhattacharya	Hierarchical stereo correspondence using features of gray connected components.	ICIP (3)	1997	DBLP DOI BibTeX RDF
29	Lichun Zhang, Yue Lu, Guoyue Chen, Patrick S. P. Wang	Image Skew Detection for Formulas without Fraction Bars Using Connected Components Analysis.	CIT	2007	DBLP DOI BibTeX RDF
29	Dennis Goehlsdorf, Michael Kaufmann 0001, Martin Siebenhaller	Placing connected components of disconnected graphs.	APVIS	2007	DBLP DOI BibTeX RDF
29	Vikrant Khanna, Phalguni Gupta, C. Jinshong Hwang	Maintenance of Connected Components in Quadtree-based Image Representation.	ITCC	2001	DBLP DOI BibTeX RDF
29	Nagarajan Ranganathan, Rajiv Mehrotra, S. Subramaniam 0001	A high speed systolic architecture for labeling connected components in an image.	SPDP	1991	DBLP DOI BibTeX RDF
28	Vlad-Andrei Munteanu	Strongly connected components-Algorithm for finding the strongly connected components of a graph.	CoRR	2018	DBLP BibTeX RDF
28	David Nassimi, Sartaj Sahni	Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF
27	Raffaella Gentilini, Carla Piazza, Alberto Policriti	Symbolic Graphs: Linear Solutions to Connectivity Related Problems.	Algorithmica	2008	DBLP DOI BibTeX RDF	Massive graphs, Model checking, Ordered binary decision diagrams, Biconnected components, Strongly connected components
27	Tzong-Wann Kao, Shi-Jinn Horng	Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems.	ISPAN	1996	DBLP DOI BibTeX RDF	bridge-connected components, reconfigurable bus system, dominator, undirected graphs, bridge, dominator tree, biconnected components, articulation point
27	Biing-Feng Wang, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points
26	Julio Martín-Herrero	Hybrid object labelling in digital images.	Mach. Vis. Appl.	2007	DBLP DOI BibTeX RDF	Object labelling, Recursive labelling, Connected components
26	Jean Frédéric Myoupo, David Semé	Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory.	J. Supercomput.	2006	DBLP DOI BibTeX RDF	Parallel algorithm, Graph theory, Broadcast, Selection, Reduction, Spanning tree, Bipartite graph, Transitive closure, Connected components, Bridge, CRCW PRAM, Articulation point
26	David A. Bader, Guojing Cong, John Feo	On the Architectural Requirements for Efficient Execution of Graph Algorithms.	ICPP	2005	DBLP DOI BibTeX RDF	Shared Memory, Multithreading, Graph Algorithms, Connected Components, List ranking
26	Manuel Arenaz, Juan Touriño, Ramon Doallo	A GSA-based compiler infrastructure to extract parallelism from complex loops.	ICS	2003	DBLP DOI BibTeX RDF	GSA, loop-level kernel recognition, parallelizing compilers, strongly connected components
26	Ka Wong Chong, Yijie Han, Tak Wah Lam	Concurrent threads and optimal parallel minimum spanning trees algorithm.	J. ACM	2001	DBLP DOI BibTeX RDF	parallel algorithms, minimum spanning trees, connected components, EREW PRAM
26	Vicent Caselles, Jose Luis Lisani, Jean-Michel Morel, Guillermo Sapiro	Shape Preserving Local Contrast Enhancement.	ICIP (1)	1997	DBLP DOI BibTeX RDF	shape preserving local contrast enhancement, local histogram equalization algorithm, image level-sets, spurious objects, image connected components, grey-valued images, mathematical morphology, image enhancement, color images, spatial relations, pixels, image information
26	Majdi Ben Hadj Ali	An Object/Segment Oriented Skew-Correction Technique for Document Images.	ICDAR	1997	DBLP DOI BibTeX RDF	Connected components, Skew detection, Skew correction, optical character recognition systems
26	Shaz Qadeer, Robert K. Brayton, Vigyan Singhal	Latch Redundancy Removal Without Global Reset.	ICCD	1996	DBLP DOI BibTeX RDF	global reset assumption, latch redundancy, safe replacement, delayed replacement, Finite state machine, core, strongly connected components
26	Sujit Dey, Srimat T. Chakradhar	Design of testable sequential circuits by repositioning flip-flops.	J. Electron. Test.	1995	DBLP DOI BibTeX RDF	cycle-breaking, flip-flop minimization, sequential redundancy, design for testability, sequential circuits, retiming, partial scan, strongly connected components, redundant fault
26	Denis Pasquignon	Computation of skeleton by partial differential equation.	ICIP	1995	DBLP DOI BibTeX RDF	skeleton computation, connectivity requirement, noise insensitive skeleton, grid effects, shape evolution, numerical scheme, image processing, experiments, partial differential equations, partial differential equation, connected components, thinning algorithms
26	A. Unnikrishnan, Priti Shankar, Y. V. Venkatesh	Threaded Linear Hierarchical Quadtree for Computation of Geometric Properties of Binary Images.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	threaded linear hierarchical quadtree, TLHQT, adjacency links, labeling connected components, quadtree environment, data structures, computational geometry, computerised picture processing, structure, binary images, geometric properties, adjacencies, linear quadtree, Euler number, perimeter
26	Henk J. A. M. Heijmans	Connected Morphological Operators and filters for Binary Images.	ICIP (2)	1997	DBLP DOI BibTeX RDF	connected morphological operators, connected morphological filters, flat zones, connected regions, grey-level, background grains, foreground grains, grain operator, grain criteria, image processing, binary images
24	Lifeng He, Yuyan Chao, Kenji Suzuki 0001	A Run-Based Two-Scan Labeling Algorithm.	IEEE Trans. Image Process.	2008	DBLP DOI BibTeX RDF
24	Donald G. Bailey, Christopher T. Johnston, Ni Ma	Connected components analysis of streamed images.	FPL	2008	DBLP DOI BibTeX RDF
24	Juan F. Carrillo, Maciej Orkisz, Marcela Hernández Hoyos	Extraction of 3D Vascular Tree Skeletons Based on the Analysis of Connected Components Evolution.	CAIP	2005	DBLP DOI BibTeX RDF
24	Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau	Counting the Number of Connected Components of a Set and Its Application to Robotics.	PARA	2004	DBLP DOI BibTeX RDF
23	Pierre Soille	On Genuine Connectivity Relations Based on Logical Predicates.	ICIAP	2007	DBLP DOI BibTeX RDF
22	Syed Saqib Bukhari, Mayce Ibrahim Ali Al Azawi, Faisal Shafait, Thomas M. Breuel	Document image segmentation using discriminative learning over connected components.	Document Analysis Systems	2010	DBLP DOI BibTeX RDF
22	Marino Tapiador, Jaime Gómez, Juan A. Sigüenza	Writer Identification Forensic System Based on Support Vector Machines with Connected Components.	IEA/AIE	2004	DBLP DOI BibTeX RDF
22	Sandeep Bhadra, Afonso Ferreira	Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks.	ADHOC-NOW	2003	DBLP DOI BibTeX RDF
21	Peter Scheiblechner	Complexity of Counting Components of Algebraic Varieties - Irreducible and Connected Components, Betti Numbers.		2008	RDF
21	Pedro Asad, Ricardo Marroquim, Andrea L. e L. Souza	On GPU Connected Components and Properties: A Systematic Evaluation of Connected Component Labeling Algorithms and Their Extension for Property Extraction.	IEEE Trans. Image Process.	2019	DBLP DOI BibTeX RDF
21	Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel	Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.	ALENEX	2018	DBLP DOI BibTeX RDF
21	Lianqiang Niu, Xin Chen, Min Peng, Gang Zhang	Connected components labeling based on union-find operations applied to connected branches.	J. Intell. Fuzzy Syst.	2017	DBLP DOI BibTeX RDF
21	Lifeng He, Yuyan Chao, Kenji Suzuki 0001	A new algorithm for labeling connected-components and calculating the Euler number, connected-component number, and hole number.	ICPR	2012	DBLP BibTeX RDF
21	Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh 0001	Structure and enumeration of two-connected graphs with prescribed three-connected components.	Adv. Appl. Math.	2009	DBLP DOI BibTeX RDF
21	Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh 0001	Two-connected graphs with prescribed three-connected components.	CoRR	2007	DBLP BibTeX RDF
21	R. Bruce Richter	Decomposing Infinite 2-Connected Graphs into 3-Connected Components.	Electron. J. Comb.	2004	DBLP DOI BibTeX RDF
21	Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald	Largest 4-Connected Components of 3-Connected Planar Triangulations.	Random Struct. Algorithms	1995	DBLP DOI BibTeX RDF
21	Steve Goddard, Subodh Kumar, Jan F. Prins	Connected components algorithms for mesh-connected parallel computers.	Parallel Algorithms	1994	DBLP DOI BibTeX RDF
21	P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal	An Efficient Connected Components Algorithm on a Mesh-Connected Computer.	ICPP	1985	DBLP BibTeX RDF
21	Michael Brinkmeier	Distributed Calculation of PageRank Using Strongly Connected Components.	IICS	2005	DBLP DOI BibTeX RDF
21	Libor Bus, Pavel Tvrdík	A Parallel Algorithm for Connected Components on Distributed Memory Machines.	PVM/MPI	2001	DBLP DOI BibTeX RDF
21	Ravi Kumar 0001, Andrew Tomkins, Erik Vee	Connectivity structure of bipartite graphs via the KNC-plot.	WSDM	2008	DBLP DOI BibTeX RDF	connectivity, bipartite graphs, connected components
21	Andrey Bogdanov	Improved Side-Channel Collision Attacks on AES.	Selected Areas in Cryptography	2007	DBLP DOI BibTeX RDF	generalized collisions, AES, side-channel attacks, random graphs, connected components, collision attacks
21	Dong Xiang, Yueli Zhang, Yi Pan 0001, Jie Wu 0001	Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes.	ICPP	2007	DBLP DOI BibTeX RDF	Deadlock-free adaptive routing, minimum-connected components, planar adaptive routing, mesh, fault-tolerant routing
21	Peter Bürgisser, Peter Scheiblechner	Differential forms in computational algebraic geometry.	ISSAC	2007	DBLP DOI BibTeX RDF	differential forms, irreducible components, complexity, connected components
21	Roderick Bloem, Harold N. Gabow, Fabio Somenzi	An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	language emptiness, Büchi automata, Streett automata, model checking, binary decision diagrams, depth-first search, breadth-first search, strongly connected components, symbolic algorithms
21	Emma E. Regentova, Shahram Latifi, De Chen, Kazem Taghva, Dongsheng Yao	Document analysis by processing JBIG-encoded images.	Int. J. Document Anal. Recognit.	2005	DBLP DOI BibTeX RDF	Form dropout, Segmentation, Connected components
21	J. Orestes Cerdeira, Leonor Santiago Pinto	Requiring Connectivity in the Set Covering Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	integer polytopes, graphs, set covering, connected components
21	Adnan Amin, Stephen Fischer	A Document Skew Detection Method Using the Hough Transform.	Pattern Anal. Appl.	2000	DBLP DOI BibTeX RDF	Hough transform, Document analysis, Connected components, Least square method, Skew detection, Projection profile
21	Victor Wu, R. Manmatha, Edward M. Riseman	TextFinder: An Automatic System to Detect and Recognize Text In Images.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	Text reading, hierarchical processing, filters, character recognition, connected-components, texture segmentation, binarization, multimedia indexing, text detection
21	Deya Motawa, Adnan Amin, Robert Sabourin	Segmentation of Arabic Cursive Script.	ICDAR	1997	DBLP DOI BibTeX RDF	Handwritten Arabic words, Singularities and Regularities, Segmentation, Mathematical Morphology, Connected Components, Slant Correction
21	Jirí Matousek 0001, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl	Fat Triangles Determine Linearly Many Holes	FOCS	1991	DBLP DOI BibTeX RDF	fat triangles, linearly many holes, complexity, randomized algorithm, connected components
21	Greg N. Frederickson, D. J. Guan	Ensemble Motion Planning in Trees	FOCS	1989	DBLP DOI BibTeX RDF	ensemble motion planning, unit capacity vehicle, minimum cost transportation, nontrivial connected components, initial vertex, route, approximation algorithms, trees, NP-hard, directed graph, objects, edges, vertices, destination, performance ratio
21	Lothar Schmitz	An improved transitive closure algorithm.	Computing	1983	DBLP DOI BibTeX RDF	transitive reduction, transitive closure, Digraphs, strongly connected components
20	Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan	Approximating the Minimum Spanning Tree Weight in Sublinear Time.	ICALP	2001	DBLP DOI BibTeX RDF
20	David A. Bader, Bernard M. E. Moret, Mi Yan	A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.	WADS	2001	DBLP DOI BibTeX RDF
19	Luca Zini, Augusto Destrero, Francesca Odone	A Classification Architecture Based on Connected Components for Text Detection in Unconstrained Environments.	AVSS	2009	DBLP DOI BibTeX RDF
19	Johannes Jendrsczok, Rolf Hoffmann, Jörg Keller 0001	Implementing Hirschberg's PRAM-Algorithm for Connected Components on a Global Cellular Automaton.	IPDPS	2007	DBLP DOI BibTeX RDF
19	Mohammad Obaid, Ramakrishnan Mukundan, Tim Bell 0001	Enhancement of Moment Based Painterly Rendering Using Connected Components.	CGIV	2006	DBLP DOI BibTeX RDF	connected component image, non-photorealistic rendering, Painterly rendering, geometric moments
19	Volker Turau	Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks.	ALGOSENSORS	2006	DBLP DOI BibTeX RDF
19	David Llorens, Andrés Marzal, Vicente Palazón, Juan Miguel Vilar	Car License Plates Extraction and Recognition Based on Connected Components Analysis and HMM Decoding.	IbPRIA (1)	2005	DBLP DOI BibTeX RDF
19	Matthieu Molinier, Tuomas Häme, Heikki Ahola	3D-Connected Components Analysis for Traffic Monitoring in Image Sequences Acquired from a Helicopter.	SCIA	2005	DBLP DOI BibTeX RDF
19	David da Silva Pires, Roberto Marcondes Cesar Junior, Marcelo Bernardes Vieira, Luiz Velho 0001	Tracking and Matching Connected Components from 3D Video.	SIBGRAPI	2005	DBLP DOI BibTeX RDF
19	Saugata Basu, Richard Pollack, Marie-Françoise Roy	Computing the first Betti number and the connected components of semi-algebraic sets.	STOC	2005	DBLP DOI BibTeX RDF	single exponential algorithms, Betti numbers, homology groups, semi-algebraic sets
19	Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter	A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components.	Euro-Par	2004	DBLP DOI BibTeX RDF
19	Tien-Yien Li, J. Maurice Rojas, Xiaoshen Wang	Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
19	Raffaella Gentilini, Carla Piazza, Alberto Policriti	Computing strongly connected components in a linear number of symbolic steps.	SODA	2003	DBLP BibTeX RDF
19	Alessandro Bevilacqua, Alessandro Lanza, Giorgio Baccarani, Riccardo Rovatti	A Single-Scan Algorithm for Connected Components Labelling in a Traffic Monitoring Application.	SCIA	2003	DBLP DOI BibTeX RDF
19	Alvaro del Val	Simplifying Binary Propositional Theories into Connected Components Twice as Fast.	LPAR	2001	DBLP DOI BibTeX RDF
19	Vikrant Khanna, Phalguni Gupta, C. Jinshong Hwang	Finding Connected Components in Digital Images.	ITCC	2001	DBLP DOI BibTeX RDF