Search results for "four-connected"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
43	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
28	Rajneesh Hegde	Finding 3-shredders efficiently.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	four-connected, shredder, vertex cut, Depth-first search
26	Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu	Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights.	GD	2008	DBLP DOI BibTeX RDF
24	Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.	Int. J. Found. Comput. Sci.	1999	DBLP DOI BibTeX RDF
24	Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs.	WG	1998	DBLP DOI BibTeX RDF
24	Shin-Ichi Nakano, Md. Saidur Rahman 0001, Takao Nishizeki	A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
24	Shin-Ichi Nakano, Md. Saidur Rahman 0001, Takao Nishizeki	A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs.	GD	1996	DBLP DOI BibTeX RDF
18	Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din	The Voronoi Diagram of Three Lines.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Quadric surface intersection, Computational geometry, Voronoi diagram, Computer algebra, Medial axis
18	Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din	The voronoi diagram of three lines.	SCG	2007	DBLP DOI BibTeX RDF	quadric surface intersection, Voronoi diagram, medial axis
15	Atheer Hussein Zyara, Hakeem Imad Mhaibes, Qahtan Makki Shallal	Enhancement of Tiny Encryption Algorithm for Resource-Constrained WSNs Using Four Connected Additive Fibonacci Generators.	J. Cyber Secur. Mobil.	2024	DBLP DOI BibTeX RDF
15	Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy	Four-Connected Triangulations of Planar Point Sets.	Discret. Comput. Geom.	2015	DBLP DOI BibTeX RDF
15	Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy	Four-connected triangulations of planar point sets.	CoRR	2013	DBLP BibTeX RDF
15	Tingbo Hu, Baojun Qi, Tao Wu 0001, Xin Xu 0001, Hangen He	Stereo matching using weighted dynamic programming on a single-direction four-connected tree.	Comput. Vis. Image Underst.	2012	DBLP DOI BibTeX RDF
15	Kenneth Anderson 0003	Additive Heuristic for Four-Connected Gridworlds.	SOCS	2010	DBLP DOI BibTeX RDF
15	Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu	Visibility representations of four-connected plane graphs with near optimal heights.	Comput. Geom.	2009	DBLP DOI BibTeX RDF
15	Muhammad Rezaul Karim 0001, Md. Saidur Rahman 0001	Four-Connected Spanning Subgraphs of Doughnut Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	Doughnut Graph, Grid Drawing, Linear Area Drawing, Planar Graph, Straight-Line Drawing
15	Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki	Convex Grid Drawings of Four-connected Plane Graphs.	Int. J. Found. Comput. Sci.	2006	DBLP DOI BibTeX RDF
15	Tibor Jordán	A characterization of weakly four-connected graphs.	J. Graph Theory	2006	DBLP DOI BibTeX RDF
15	Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi	Bisecting a Four-Connected Graph with Three Resource Sets.	ISAAC	2005	DBLP DOI BibTeX RDF
15	Kazuyuki Miura, Takao Nishizeki	Rectangle-of-Influence Drawings of Four-Connected Plane Graphs.	APVIS	2005	DBLP BibTeX RDF
15	Thor Johnson, Robin Thomas 0001	Generating Internally Four-Connected Graphs.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
15	Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano	Convex Grid Drwaings of Four-Connected Plane Graphs.	ISAAC	2000	DBLP DOI BibTeX RDF
15	Ervin Györi, Tibor Jordán	How to make a graph four-connected.	Math. Program.	1999	DBLP DOI BibTeX RDF
15	Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki	Grid Drawings of Four-Connected Plane Graphs.	GD	1999	DBLP DOI BibTeX RDF
15	Chung-Ming Chen	An Efficient Four-Connected Parallel System for PET Image Reconstruction.	Parallel Comput.	1998	DBLP DOI BibTeX RDF
15	Jianer Chen, Arkady Kanevsky	On Assembly of Four-Connected Graphs (Extended Abstract).	WG	1992	DBLP DOI BibTeX RDF
14	Hubert de Fraysseix, Patrice Ossona de Mendez	Representations by Contact and Intersection of Segments.	Algorithmica	2007	DBLP DOI BibTeX RDF
14	Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun	Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer.	STACS	2003	DBLP DOI BibTeX RDF
12	Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel	Between umbra and penumbra.	SCG	2007	DBLP DOI BibTeX RDF	umbra, complexity, shadows, penumbra, discontinuity mesh
11	Stéphane Fischer, Birgitta Dresp, Charles Kopp	A Neural Network Model for Long-Range Contour Diffusion by Visual Cortex.	Biologically Motivated Computer Vision	2000	DBLP DOI BibTeX RDF
8	Rebecca Alexander, Heather Dyson, Joseph O'Rourke	The Foldings of a Square to Convex Polyhedra.	JCDCG	2002	DBLP DOI BibTeX RDF
6	Michael Kaufmann 0001, Roland Wiese	Embedding Vertices at Points: Few Bends Suffice for Planar Graphs.	GD	1999	DBLP DOI BibTeX RDF