Search results for "vertices"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Esther Ezra, János Pach, Micha Sharir	On Regular Vertices of the Union of Planar Convex Objects.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Geometric arrangements, Union of planar regions, Regular vertices, Bi-clique decompositions, (1/r)-cuttings, Lower envelopes
3	David Coudert, Frédéric Giroire, Ignasi Sau	Edge-Simple Circuits through 10 Ordered Vertices in Square Grids.	IWOCA	2009	DBLP DOI BibTeX RDF	edge-simple circuit, prescribed vertices, ILP solver, square grid
3	Shmuel Onn, Uriel G. Rothblum	The use of edge-directions and linear programming to enumerate vertices.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Edge-directions, Linear programming, Vertices, Polytopes
3	Esther Ezra, János Pach, Micha Sharir	On regular vertices on the union of planar objects.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	(1/r)-cuttings, regular vertices, union of geometric objects
3	Naveen Garg	A 3-Approximation for the Minimum Tree Spanning k Vertices.	FOCS	1996	DBLP DOI BibTeX RDF	minimum tree, 3-approximation, k-vertices, minimum tour, spanning k vertices, graph, trees (mathematics)
3	Franck Xia	Invariant property of contour: VPIUD with arbitrary neighborhood. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	VPIUD, neighbourhood, virtual perimeter increment under dilation, contour VPIUD, contour propagation model, secondary waves, convex vertices, concave vertices, 8-neighborhood, 6-neighborhood, total curvature, hole contours, outer contours, contour classification, edge detection, optical character recognition, images, image classification, Chinese characters, invariant property
3	David W. Paglieroni, Gary E. Ford, Eric M. Tsujimoto	The Position-Orientation Masking Approach to Parametric Search for Template Matching.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	position-orientation masking, edge segments matching, template vertices, image vertices, binary decomposition, quadrant decomposition, edge detection, transforms, correlations, search problems, template matching, distance transforms, correlation methods, parametric search
2	Hongwei Wang	A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices.	COCOA	2009	DBLP DOI BibTeX RDF
2	Wei Ding, Guoliang Xue	A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices.	COCOA	2009	DBLP DOI BibTeX RDF	Most reliable source, Transmitting probability, Receiving probability
2	Marián Klesc	On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices.	IWOCA	2009	DBLP DOI BibTeX RDF	graph, drawing, crossing number, Cartesian product, star
2	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating All Vertices of a Polyhedron Is Hard.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF
2	Seok-Hee Hong, Martin Mader	Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints.	Graph Drawing	2008	DBLP DOI BibTeX RDF
2	Hugo Gimbert, Florian Horn	Simple Stochastic Games with Few Random Vertices Are Easy to Solve.	FoSSaCS	2008	DBLP DOI BibTeX RDF
2	Marc Alexa, Tamy Boubekeur	Subdivision shading.	ACM Trans. Graph.	2008	DBLP DOI BibTeX RDF	irregular vertices, subdivision, shading, visual quality
2	E. D. Gluskin, A. E. Litvak	Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Asymmetry of polytopes, Illumination parameter, Measures of symmetry, Polytopes with few vertices, Vertex index
2	Sy-Yen Kuo, Fu-Min Yeh, Hung-Yau Lin	Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices.	IEEE Transactions on Reliability	2007	DBLP DOI BibTeX RDF
2	William Duckworth, Michele Zito	Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs.	MFCS	2007	DBLP DOI BibTeX RDF
2	Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary	On Computing the Centroid of the Vertices of an Arrangement and Related Problems.	WADS	2007	DBLP DOI BibTeX RDF
2	Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff	Moving Vertices to Make Drawings Plane.	Graph Drawing	2007	DBLP DOI BibTeX RDF
2	Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath	Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.	Graph Drawing	2007	DBLP DOI BibTeX RDF
2	Martin C. Cooper	Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes.	International Journal of Computer Vision	2007	DBLP DOI BibTeX RDF	line drawing labelling, non-trihedral vertices, valued constraint satisfaction problem, soft constraints, polyhedral objects, parallel lines
2	Bill Jackson, Tibor Jordán, Zoltan Szabadka	Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs.	Discrete & Computational Geometry	2006	DBLP DOI BibTeX RDF
2	Julien Moncel	Constructing codes identifying sets of vertices.	Des. Codes Cryptography	2006	DBLP DOI BibTeX RDF	AMS classifications, 94C12, 94B60, 05C99
2	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating all vertices of a polyhedron is hard.	SODA	2006	DBLP DOI BibTeX RDF	enumeration problem, facet enumeration, feasible system, negative cycle, polytope-polyhedron problem, vertex enumeration, graph, cycle, face, polytope, polyhedron, facet, vertex, linear inequalities
2	Xiaomei Liu, Li Xiao, Andrew Kreling, Yunhao Liu	Optimizing overlay topology by reducing cut vertices.	NOSSDAV	2006	DBLP DOI BibTeX RDF
2	Zvi Lotker, Alfredo Navarra	Unbalanced Points and Vertices Problem.	PerCom Workshops	2006	DBLP DOI BibTeX RDF
2	Michael D. Henning, Michael D. Plummer	Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	paired-domination number, tree
2	Zi-Xia Song, H. P. Yap	Chromatic Index Critical Graphs of Even Order with Five Major Vertices.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF
2	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi	Vertices of Degree 5 in a Contraction Critically 5-connected Graph.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	AMS Subject Classification, 05C40
2	Fajie Li, Reinhard Klette	The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points.	DGCI	2005	DBLP DOI BibTeX RDF
2	Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe	Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree.	ISCAS	2005	DBLP DOI BibTeX RDF
2	Yusuke Hioka, Nozomu Hamada	Speaker direction tracking using microphones located at the vertices of equilateral-triangle.	ISCAS	2005	DBLP DOI BibTeX RDF
2	Chang-Hyo Yu, Donghyun Kim, Lee-Sup Kim	A 33.2M vertices/sec programmable geometry engine for multimedia embedded systems.	ISCAS	2005	DBLP DOI BibTeX RDF
2	Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes	From Balls and Bins to Points and Vertices.	ISAAC	2005	DBLP DOI BibTeX RDF
2	Xiangyu Yu, Hong Sun	Automatic Image Registration via Clustering and Convex Hull Vertices Matching.	ADMA	2005	DBLP DOI BibTeX RDF
2	Wayne Goddard	Minimum Degree Conditions for Cycles Including Specified Sets of Vertices.	Graphs and Combinatorics	2004	DBLP DOI BibTeX RDF
2	Jesús A. De Loera, Tyrrell B. McAllister	Vertices of Gelfand-Tsetlin Polytopes.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
2	Robert Haas, Michael Hoffmann	Chordless Paths Through Three Vertices.	IWPEC	2004	DBLP DOI BibTeX RDF
2	P. A. C. Varley, Hiromasa Suzuki, Ralph R. Martin	Interpreting Line Drawings of Objects with K-Vertices.	GMP	2004	DBLP DOI BibTeX RDF
2	Ana Paula Tomás, António Leslie Bajuelos	Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices.	ICCSA	2004	DBLP DOI BibTeX RDF
2	António Leslie Bajuelos, Ana Paula Tomás, Fábio Marques	Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces.	ICCSA	2004	DBLP DOI BibTeX RDF
2	Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian	Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace.	Combinatorica	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05D05, 15A03
2	Debashis Bera, Madhumangal Pal, Tapan Kumar Pal	An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
2	Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll	Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems.	DMTCS	2003	DBLP DOI BibTeX RDF
2	Janez Zaletelj, Jurij F. Tasic	Optimization and Tracking of Polygon Vertices for Shape Coding.	CAIP	2003	DBLP DOI BibTeX RDF
2	Toshimasa Ishii, Masayuki Hagiwara	Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs.	MFCS	2003	DBLP DOI BibTeX RDF
2	Gill Barequet, Michael T. Goodrich, Chris Riley	Drawing Graphs with Large Vertices and Thick Edges.	WADS	2003	DBLP DOI BibTeX RDF
2	Dimitrios Katsoulas	Robust Extraction of Vertices in Range Images by Constraining the Hough Transform.	IbPRIA	2003	DBLP DOI BibTeX RDF
2	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	2003	DBLP DOI BibTeX RDF
2	Graham M. Seed, Douglas E. R. Clark, Raffaella Ocone, Xiaoyan Y. Yang	Four Colouring the Vertices of the Triangulation of a Polygon Containing a Hole.	ICCSA	2003	DBLP DOI BibTeX RDF
2	Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner	High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
2	Matthias Kriesell	Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph.	Graphs and Combinatorics	2002	DBLP DOI BibTeX RDF
2	Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro	Spanning Trees with Bounded Number of Branch Vertices.	ICALP	2002	DBLP DOI BibTeX RDF
2	T. Ozawa	Efficient algorithms for planar embedding of graphs with constraints in placing specified vertices on face boundaries.	ISCAS	2002	DBLP DOI BibTeX RDF
2	Yvo Desmedt, Yongge Wang	Maximum Flows and Critical Vertices in AND/OR Graphs.	COCOON	2002	DBLP DOI BibTeX RDF
2	Toshinori Sakai	Long Paths through Specified Vertices in 3-Connected Graphs.	JCDCG	2002	DBLP DOI BibTeX RDF
2	Jin Akiyama, Gisaku Nakamura	Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon.	JCDCG	2002	DBLP DOI BibTeX RDF
2	Seiya Negami, Atsuhiro Nakamoto	Triangulations on Closed Surfaces Covered by Vertices of Given Degree.	Graphs and Combinatorics	2001	DBLP DOI BibTeX RDF
2	Gregory Gutin, Anders Yeo	Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs.	Graphs and Combinatorics	2001	DBLP DOI BibTeX RDF
2	B. Datta, N. Nilakantan	Equivelar Polyhedra with Few Vertices.	Discrete & Computational Geometry	2001	DBLP DOI BibTeX RDF
2	Deok-Soo Kim, Jaeyeol Chung, Youngsong Cho, Taeboom Jang, Hyun Kim	Geometry Compression Based on Mantissa Chunking of Vertices. (PDF / PS)	IV	2001	DBLP DOI BibTeX RDF
2	Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn	On the Identification of Vertices and Edges Using Cycles.	AAECC	2001	DBLP DOI BibTeX RDF	binary hypercube, Lee metric, graph, multiprocessor system, Identification, cycle, Hamming distance
2	N. S. Narayanaswamy, C. E. Veni Madhavan	On Assigning Prefix Free Codes to the Vertices of a Graph.	COCOON	2001	DBLP DOI BibTeX RDF
2	Markus Eiglsperger, Michael Kaufmann	Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.	Graph Drawing	2001	DBLP DOI BibTeX RDF
2	Kevin G. Suffern	Ray tracing four spheres at the vertices of a regular tetrahedron.	The Visual Computer	2000	DBLP DOI BibTeX RDF	Sierpinski gasket, Ray tracing, Fractals, Chaos, Spheres
2	Mekkia Kouider	Neighborhoods and Covering Vertices by Cycles.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C38, 05C35, 05C70
2	Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia	Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size.	Graph Drawing	1999	DBLP DOI BibTeX RDF
2	Kaihuai Qin, Zesheng Tang, Wenping Wang	Representing Spheres and Ellipsoids Using Periodic NURBS Surfaces with Fewer Control Vertices.	Pacific Conference on Computer Graphics and Applications	1998	DBLP DOI BibTeX RDF
2	Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir	On the Number of Regular Vertices of the Union of Jordan Regions.	SWAT	1998	DBLP DOI BibTeX RDF
2	Ulrich Kortenkamp	Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope.	Discrete & Computational Geometry	1997	DBLP DOI BibTeX RDF
2	Ali Mohammad-Djafari, Yassine Khayi, Ken Sauer, Eric Cano	Reconstruction of the Shape of a Compact Object from Few Projections. (PDF / PS)	ICIP	1997	DBLP DOI BibTeX RDF	compact object, limited tomographic projection data, NDT, air hole, homogeneous region, metal, industrial techniques, default region shape, tomographic reconstruction, global optimization method, pixel representation, 2D representation, contour modelling, local descent-based method, moment based method, Bayesian MAP estimation, localization, coordinates, simulated annealing, image reconstruction, detection, polygon, industrial applications, characterization, vertices, surface modelling, inclusion, polyhedron, shape reconstruction, computational cost, 3D representation, voxel representation, nondestructive testing
2	Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen	An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	efficient parallel strategy, K-terminal reliability computation, most vital edge finding, 2-trees, partial 2-trees, connected graph components, logarithmic time, reliability, processors, edges, computation time, vertices, CRCW PRAM
2	Christian Capelle, Michel Habib	Graph decompositions and factorizing permutations. (PDF / PS)	ISTCS	1997	DBLP DOI BibTeX RDF	factorizing permutations, decomposition sets, inheritance graph decomposition, optimization, graph theory, vertices, undirected graph, chordal graphs, graph decompositions, decomposition algorithms, linear algorithm, modular decomposition, decomposition tree
2	Ron Shamir, Dekel Tsur	Faster subtree isomorphism. (PDF / PS)	ISTCS	1997	DBLP DOI BibTeX RDF	subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem
2	Philippe Clauss, Vincent Loechner	Parametric Analysis of Polyhedral Iteration Spaces.	ASAP	1996	DBLP DOI BibTeX RDF	parametric vertices, parametric counting, Ehrhart polynomials, automatic parallelization, nested loops, convex polyhedra
2	Panos A. Patsouris	Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	two-level-hierarchies of objects, unit of reference, distributed object-oriented databases, partial directed acyclic graphs, vertices objects, Uni-Design, distribution design strategy, distributed databases, aggregation, object-oriented databases, directed graphs, grouping, association, equivalence relation
2	Gabriel Taubin	Curve and Surface Smoothing without Shrinkage. (PDF / PS)	ICCV	1995	DBLP DOI BibTeX RDF	piecewise-linear techniques, curve smoothing, scientific data visualization, multimodal medical data registration, polygonal curves, boundary-following algorithms, iso-surface construction algorithms, piecewise linear shapes, linear low-pass filter, high curvature variations, required storage, computer vision, computational complexity, computational complexity, approximation algorithms, computational geometry, topology, image registration, medical image processing, data visualisation, curve fitting, edges, faces, vertices, smoothing methods, faceting, shrinkage, polyhedral surfaces, surface smoothing
2	John R. Gilbert, Gary L. Miller, Shang-Hua Teng	Geometric mesh partitioning: implementation and experiments. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	geometric mesh partitioning, equal-sized pieces, geometric coordinates, mesh vertices, Matlab code, spectral bisection, computational geometry, mesh generation, finite element analysis, irregular mesh, finite element meshes
2	Satoshi Taoka, Toshimasa Watanabe	Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph.	ISAAC	1994	DBLP DOI BibTeX RDF
2	David G. Kirkpatrick, Jack Snoeyink	Tentative Prune-and-Search for Computing Voronoi Vertices.	Symposium on Computational Geometry	1993	DBLP DOI BibTeX RDF
2	Elias Dahlhaus	Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes.	WG	1992	DBLP DOI BibTeX RDF
2	H. S. Lee, R. C. Chang	Approximating Vertices of a Convex Polygon with Grid Points in the Polygon.	ISAAC	1992	DBLP DOI BibTeX RDF
2	Enrico De Micheli, Bruno Caprile, P. Ottonello, Vincent Torre	Localization and Noise in Edge Detection.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	trihedral vertices, gradient schemes, zero-crossing schemes, localization, edge detection, filters, noise, computerised picture processing, computerised picture processing, computerised pattern recognition, computerised pattern recognition, sensitivity, digital images
2	Ondrej Sýkora, Imrich Vrto	Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region.	STACS	1984	DBLP DOI BibTeX RDF
1	Neil Robertson, Paul D. Seymour	Graph Minors. XXII. Irrelevant vertices in linkage problems.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
1	William Chung-Kung Yen	The connected p-center problem on block graphs with forbidden vertices.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
1	Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries	Colouring vertices of triangle-free graphs without forests.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Elliot Krop, Sin-Min Lee, Christopher Raridan	On the number of unlabeled vertices in edge-friendly labelings of graphs.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Zejun Huang, Xingzhi Zhan	Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Ville Junnila	Adaptive Identification of Sets of Vertices in Graphs.	Discrete Mathematics & Theoretical Computer Science	2012	DBLP BibTeX RDF
1	Bo Cheng, Bolian Liu	Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions.	Appl. Math. Lett.	2012	DBLP DOI BibTeX RDF
1	Xiaomei Liu, Li Xiao, Andrew Kreling	A Fully Distributed Method to Detect and Reduce Cut Vertices in Large-Scale Overlay Networks.	IEEE Trans. Computers	2012	DBLP DOI BibTeX RDF
1	Mijung Kim, K. Selçuk Candan	SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices.	Data Knowl. Eng.	2012	DBLP DOI BibTeX RDF
1	Przemyslaw Gordinowicz, Pawel Pralat	The first player wins the one-colour triangle avoidance game on 16 vertices.	Discussiones Mathematicae Graph Theory	2012	DBLP BibTeX RDF
1	Stylianos C. Despotakis, Ioannis Z. Emiris	An upper bound on Euclidean embeddings of rigid graphs with 8 vertices	CoRR	2012	DBLP BibTeX RDF
1	Rafael R. Kamalian	Estimates for the number of vertices with an interval spectrum in proper edge colorings of some graphs	CoRR	2012	DBLP BibTeX RDF
1	Erik Quaeghebeur	Characterizing the Set of Coherent Lower Previsions with a Finite Number of Constraints or Vertices	CoRR	2012	DBLP BibTeX RDF
1	D. V. Karpov	Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4	CoRR	2012	DBLP BibTeX RDF
1	Benjamin A. Burton	Complementary vertices and adjacency testing in polytopes	CoRR	2012	DBLP BibTeX RDF
1	Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri	All graphs with at most seven vertices are Pairwise Compatibility Graphs	CoRR	2012	DBLP BibTeX RDF