Search results for "Vertices"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
49	Naveen Garg 0001	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)
48	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
44	Franck Xia	Invariant property of contour: VPIUD with arbitrary neighborhood.	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
44	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
43	Anand Bhalgat, Ramesh Hariharan	Fast edge orientation for unweighted graphs.	SODA	2009	DBLP DOI BibTeX RDF
39	Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia	Mix and match.	EC	2010	DBLP DOI BibTeX RDF	approximate mechanism design without money, kidney exchange
39	Chinmoy Dutta, Jaikumar Radhakrishnan	Tradeoffs in Depth-Two Superconcentrators.	STACS	2006	DBLP DOI BibTeX RDF
39	Xin Yao 0003, Changshui Zhang, Jinwen Chen, Yanda Li	On the Scale-Free Intersection Graphs.	ICCSA (2)	2005	DBLP DOI BibTeX RDF
35	Esther Ezra, János Pach, Micha Sharir	On Regular Vertices of the Union of Planar Convex Objects.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Geometric arrangements, Union of planar regions, Regular vertices, Bi-clique decompositions, (1/r)-cuttings, Lower envelopes
35	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
35	Esther Ezra, János Pach, Micha Sharir	On regular vertices on the union of planar objects.	SCG	2007	DBLP DOI BibTeX RDF	(1/r)-cuttings, regular vertices, union of geometric objects
34	Anvesh Komuravelli, Matús Mihalák	Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision.	SSS	2009	DBLP DOI BibTeX RDF
34	Klim Efremenko, Omer Reingold	How Well Do Random Walks Parallelize?.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	Markov Chains, Random Walks
34	Reuven Bar-Yehuda, Craig Gotsman	Time/Space Tradeoffs for Polygon Mesh Rendering.	ACM Trans. Graph.	1996	DBLP DOI BibTeX RDF	rendering, polygons, graphics pipeline
31	Efim D. Gluskin, Alexander E. Litvak	Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Asymmetry of polytopes, Illumination parameter, Measures of symmetry, Polytopes with few vertices, Vertex index
30	Wei Ding 0006, 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
30	Zvi Lotker, Alfredo Navarra	Unbalanced Points and Vertices Problem.	PerCom Workshops	2006	DBLP DOI BibTeX RDF
30	Robert Haas 0001, Michael Hoffmann 0001	Chordless Paths Through Three Vertices.	IWPEC	2004	DBLP DOI BibTeX RDF
30	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
30	Satoshi Taoka, Toshimasa Watanabe	Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph.	ISAAC	1994	DBLP DOI BibTeX RDF
30	Konstantinos Panagiotou, Angelika Steger	Maximal biconnected subgraphs of random planar graphs.	SODA	2009	DBLP DOI BibTeX RDF
30	Mohammad Tanvir Parvez, Md. Saidur Rahman 0001, Shin-Ichi Nakano	Generating All Triangulations of Plane Graphs (Extended Abstract).	WALCOM	2009	DBLP DOI BibTeX RDF	Genealogical Tree, Graph, Triangulation, Polygon, Plane Graph
30	Stavros D. Nikolopoulos, Leonidas Palios	Detecting Holes and Antiholes in Graphs.	Algorithmica	2007	DBLP DOI BibTeX RDF
30	Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng	Local Computation of PageRank Contributions.	WAW	2007	DBLP DOI BibTeX RDF
30	Puneet Maheshwari, Parag Agarwal, Balakrishnan Prabhakaran 0001	Progressive compression invariant semi-fragile watermarks for 3d meshes.	MM&Sec	2007	DBLP DOI BibTeX RDF	authentication, compression, watermarking
30	Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov	Approximation Algorithms for the Black and White Traveling Salesman Problem.	COCOON	2007	DBLP DOI BibTeX RDF
30	Steve Hanneke	An analysis of graph cut size for transductive learning.	ICML	2006	DBLP DOI BibTeX RDF
30	Purvi Saraiya, Peter Lee 0005, Chris North 0001	Visualization of Graphs with Associated Timeseries Data.	INFOVIS	2005	DBLP DOI BibTeX RDF	data overlay, timeseries data analysis, usability experiments, Graph visualization
30	Alexander Gribov, Eugene Bodansky	A New Method of Polyline Approximation.	SSPR/SPR	2004	DBLP DOI BibTeX RDF	polylinecompression, polyline approximation, vectorization, shape analysis
30	Colin Cooper	Classifying Special Interest Groups in Web Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
30	David Peleg	Informative Labeling Schemes for Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
30	Ton Kloks, Hans L. Bodlaender	Testing Superperfection of k-Trees.	SWAT	1992	DBLP DOI BibTeX RDF
26	Martin C. Cooper	Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes.	Int. J. Comput. Vis.	2007	DBLP DOI BibTeX RDF	line drawing labelling, non-trihedral vertices, valued constraint satisfaction problem, soft constraints, polyhedral objects, parallel lines
26	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
26	Oleg V. Borodin, Anna O. Ivanova	3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices.	Discret. Math.	2022	DBLP DOI BibTeX RDF
26	Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga	How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?	SODA	2021	DBLP DOI BibTeX RDF
26	Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova	Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9.	Discuss. Math. Graph Theory	2020	DBLP DOI BibTeX RDF
26	Cristina Maier, Dan A. Simovici	Betweenness Centrality of Sets of Vertices in Graphs: which Vertices to Associate.	ICISDM	2020	DBLP DOI BibTeX RDF
26	Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak	Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8.	Discret. Math.	2019	DBLP DOI BibTeX RDF
26	Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak	Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11.	Discuss. Math. Graph Theory	2018	DBLP DOI BibTeX RDF
26	Shuya Chiba, Shinya Fujita 0001	Covering vertices by a specified number of disjoint cycles, edges and isolated vertices.	Discret. Math.	2013	DBLP DOI BibTeX RDF
26	Xinying Pai, Sanyang Liu	On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with Vertices and Pendent Vertices.	J. Appl. Math.	2012	DBLP DOI BibTeX RDF
26	Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi	Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs.	Algorithmica	2010	DBLP DOI BibTeX RDF
26	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary	Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra	CoRR	2008	DBLP BibTeX RDF
26	Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi	Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs.	CATS	2003	DBLP DOI BibTeX RDF
26	Shinsei Tazawa, Teruhiro Shirakura, Saburo Tamura	Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree.	Discret. Math.	1991	DBLP DOI BibTeX RDF
26	Hans-Dietrich O. F. Gronau	Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I.	Discret. Math.	1981	DBLP DOI BibTeX RDF
26	Hans Georg Carstens, Arian Kruse	Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices.	J. Comb. Theory, Ser. B	1977	DBLP DOI BibTeX RDF
26	Hugo Gimbert, Florian Horn 0001	Simple Stochastic Games with Few Random Vertices Are Easy to Solve.	FoSSaCS	2008	DBLP DOI BibTeX RDF
26	Sy-Yen Kuo, Fu-Min Yeh, Hung-Yau Lin	Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices.	IEEE Trans. Reliab.	2007	DBLP DOI BibTeX RDF
26	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
26	Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes	From Balls and Bins to Points and Vertices.	ISAAC	2005	DBLP DOI BibTeX RDF
26	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 (1)	2005	DBLP DOI BibTeX RDF
26	Jesús A. De Loera, Tyrrell B. McAllister	Vertices of Gelfand-Tsetlin Polytopes.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
26	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
26	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
26	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 (3)	2003	DBLP DOI BibTeX RDF
26	Toshinori Sakai	Long Paths through Specified Vertices in 3-Connected Graphs.	JCDCG	2002	DBLP DOI BibTeX RDF
26	T. Ozawa	Efficient algorithms for planar embedding of graphs with constraints in placing specified vertices on face boundaries.	ISCAS (5)	2002	DBLP DOI BibTeX RDF
26	N. S. Narayanaswamy, C. E. Veni Madhavan	On Assigning Prefix Free Codes to the Vertices of a Graph.	COCOON	2001	DBLP DOI BibTeX RDF
26	Andreas Spillner 0001, Alexander Wolff 0001	Untangling a Planar Graph.	SOFSEM	2008	DBLP DOI BibTeX RDF
26	Andrzej Lingas, Martin Wahlen	On Exact Complexity of Subgraph Homeomorphism.	TAMC	2007	DBLP DOI BibTeX RDF
26	Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee	Two Variations of the Minimum Steiner Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time
26	Shyh-Kuang Ueng, Yan-Jen Su, Chi-Tang Chang	LoD Volume Rendering of FEA Data.	IEEE Visualization	2004	DBLP DOI BibTeX RDF	splatting method, Volume rendering, level-of-detail, scientific visualization, unstructured data
26	John Burns 0001, Heather J. Ruskin	Network Topology in Immune System Shape Space.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
26	Ediz Saykol, Gürcan Gülesir, Ugur Güdükbay, Özgür Ulusoy	KiMPA: A Kinematics-Based Method for Polygon Approximation.	ADVIS	2002	DBLP DOI BibTeX RDF
26	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF
26	Zhangjian Li, Shin-Ichi Nakano	Efficient Generation of Plane Triangulations without Repetitions.	ICALP	2001	DBLP DOI BibTeX RDF
26	Claudio Esperança, Hanan Samet	Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies.	SSD	1997	DBLP DOI BibTeX RDF
22	Marc Alexa, Tamy Boubekeur	Subdivision shading.	ACM Trans. Graph.	2008	DBLP DOI BibTeX RDF	irregular vertices, subdivision, shading, visual quality
22	Ali Mohammad-Djafari, Yassine Khayi, Ken D. Sauer, Eric Cano	Reconstruction of the Shape of a Compact Object from Few Projections.	ICIP (1)	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
22	Ron Shamir, Dekel Tsur	Faster subtree isomorphism.	ISTCS	1997	DBLP DOI BibTeX RDF	subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem
22	Christian Capelle, Michel Habib	Graph decompositions and factorizing permutations.	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
22	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.	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
22	Panos A. Patsouris	Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases.	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
22	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
22	Gabriel Taubin	Curve and Surface Smoothing without Shrinkage.	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
22	John R. Gilbert, Gary L. Miller, Shang-Hua Teng	Geometric mesh partitioning: implementation and experiments.	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
22	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
22	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating All Vertices of a Polyhedron Is Hard.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF
22	William Duckworth, Michele Zito 0001	Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs.	MFCS	2007	DBLP DOI BibTeX RDF
22	Bill Jackson, Tibor Jordán, Zoltan Szabadka	Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
22	Xiaomei Liu, Li Xiao 0001, Andrew Kreling, Yunhao Liu 0001	Optimizing overlay topology by reducing cut vertices.	NOSSDAV	2006	DBLP DOI BibTeX RDF
22	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi	Vertices of Degree 5 in a Contraction Critically 5-connected Graph.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	AMS Subject Classification, 05C40
22	Michael A. 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
22	Xiangyu Yu, Hong Sun	Automatic Image Registration via Clustering and Convex Hull Vertices Matching.	ADMA	2005	DBLP DOI BibTeX RDF
22	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 (3)	2004	DBLP DOI BibTeX RDF
22	P. A. C. Varley, Hiromasa Suzuki, Ralph R. Martin	Interpreting Line Drawings of Objects with K-Vertices.	GMP	2004	DBLP DOI BibTeX RDF
22	Dimitrios Katsoulas	Robust Extraction of Vertices in Range Images by Constraining the Hough Transform.	IbPRIA	2003	DBLP DOI BibTeX RDF
22	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
22	Gill Barequet, Michael T. Goodrich, Chris Riley	Drawing Graphs with Large Vertices and Thick Edges.	WADS	2003	DBLP DOI BibTeX RDF
22	Matthias Kriesell	Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
22	Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro	Spanning Trees with Bounded Number of Branch Vertices.	ICALP	2002	DBLP DOI BibTeX RDF
22	Yvo Desmedt, Yongge Wang	Maximum Flows and Critical Vertices in AND/OR Graphs.	COCOON	2002	DBLP DOI BibTeX RDF
22	Gregory Z. 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 Comb.	2001	DBLP DOI BibTeX RDF
22	Deok-Soo Kim, Jaeyeol Chung, Youngsong Cho, Taeboom Jang, Hyun Kim	Geometry Compression Based on Mantissa Chunking of Vertices.	IV	2001	DBLP DOI BibTeX RDF
22	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
22	Mekkia Kouider	Neighborhoods and Covering Vertices by Cycles.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C38, 05C35, 05C70
22	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
22	Ulrich Kortenkamp	Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF