Search results for "vertices"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Wayne Goddard	Minimum Degree Conditions for Cycles Including Specified Sets of Vertices.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
17	Ana Paula Tomás, António Leslie Bajuelos	Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices.	ICCSA (3)	2004	DBLP DOI BibTeX RDF
17	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.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05D05, 15A03
17	Toshimasa Ishii, Masayuki Hagiwara	Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs.	MFCS	2003	DBLP DOI BibTeX RDF
17	Janez Zaletelj, Jurij F. Tasic	Optimization and Tracking of Polygon Vertices for Shape Coding.	CAIP	2003	DBLP DOI BibTeX RDF
17	Jin Akiyama, Gisaku Nakamura	Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon.	JCDCG	2002	DBLP DOI BibTeX RDF
17	Seiya Negami, Atsuhiro Nakamoto	Triangulations on Closed Surfaces Covered by Vertices of Given Degree.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
17	Basudeb Datta, Nandini Nilakantan	Equivelar Polyhedra with Few Vertices.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
17	Markus Eiglsperger, Michael Kaufmann 0001	Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.	GD	2001	DBLP DOI BibTeX RDF
17	Kevin G. Suffern	Ray tracing four spheres at the vertices of a regular tetrahedron.	Vis. Comput.	2000	DBLP DOI BibTeX RDF	Sierpinski gasket, Ray tracing, Fractals, Chaos, Spheres
17	Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia	Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size.	GD	1999	DBLP DOI BibTeX RDF
17	Kaihuai Qin, Zesheng Tang, Wenping Wang	Representing Spheres and Ellipsoids Using Periodic NURBS Surfaces with Fewer Control Vertices.	PG	1998	DBLP DOI BibTeX RDF
17	David G. Kirkpatrick, Jack Snoeyink	Tentative Prune-and-Search for Computing Voronoi Vertices.	SCG	1993	DBLP DOI BibTeX RDF
17	Hsuan-Shih Lee, Ruei Chuan Chang	Approximating Vertices of a Convex Polygon with Grid Points in the Polygon.	ISAAC	1992	DBLP DOI BibTeX RDF
17	Elias Dahlhaus	Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes.	WG	1992	DBLP DOI BibTeX RDF
17	Charles L. Cartledge, Michael L. Nelson	Analysis of graphs for digital preservation suitability.	HT	2010	DBLP DOI BibTeX RDF	robustness, resilience, small world
17	Chansophea Chuon, Sumanta Guha	Surface Mesh Segmentation Using Local Geometry.	CGIV	2009	DBLP DOI BibTeX RDF
17	Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy	Size complexity of volume meshes vs. surface meshes.	SODA	2009	DBLP DOI BibTeX RDF
17	Yusuke Kobayashi 0001, Ken-ichi Kawarabayashi	Algorithms for finding an induced cycle in planar graphs and bounded genus graphs.	SODA	2009	DBLP DOI BibTeX RDF
17	Yuri Dimitrov, Mario Lauria	A Stochastic Model for Layered Self-organizing Complex Systems.	Complex (2)	2009	DBLP DOI BibTeX RDF
17	Inge Li Gørtz, Viswanath Nagarajan, R. Ravi 0001	Minimum Makespan Multi-vehicle Dial-a-Ride.	ESA	2009	DBLP DOI BibTeX RDF
17	Alina Stoica, Christophe Prieur 0002	Structure of Neighborhoods in a Large Social Network.	CSE (4)	2009	DBLP DOI BibTeX RDF
17	Alexis Darrasse, Michèle Soria	Limiting Distribution for Distances in k-Trees.	IWOCA	2009	DBLP DOI BibTeX RDF
17	K. Subramani 0001, Kamesh Madduri	Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem.	COCOA	2009	DBLP DOI BibTeX RDF
17	Hannes Moser	A Problem Kernelization for Graph Packing.	SOFSEM	2009	DBLP DOI BibTeX RDF
17	Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	On the Directed Degree-Preserving Spanning Tree Problem.	IWPEC	2009	DBLP DOI BibTeX RDF
17	Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell	Eliminating Cycles in the Discrete Torus.	Algorithmica	2008	DBLP DOI BibTeX RDF	Discrete torus, Foam, Tiling, Multicut
17	Vesna Zeljkovic, Claude Tameze, Robert B. Vincelette	Combined nonlinear inverse diffusion filter and triangle method used for noise removal from polygonal shapes.	ICIP	2008	DBLP DOI BibTeX RDF
17	Panagiota N. Panagopoulou, Paul G. Spirakis	A Game Theoretic Approach for Efficient Graph Coloring.	ISAAC	2008	DBLP DOI BibTeX RDF
17	Frank Kammer, Torsten Tholey	The Complexity of Minimum Convex Coloring.	ISAAC	2008	DBLP DOI BibTeX RDF	Convex Coloring, Maximum Disjoint Paths Problem
17	Fedor V. Fomin, Yngve Villanger	Treewidth Computation and Extremal Combinatorics.	ICALP (1)	2008	DBLP DOI BibTeX RDF
17	Hanan Samet, Jagan Sankaranarayanan, Houman Alborzi	Scalable network distance browsing in spatial databases.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	shortest path quadtree, scalability, nearest neighbor, decoupling, spatial networks
17	Yan Gérard, Fabien Feschet, David Coeurjolly	Gift-Wrapping Based Preimage Computation Algorithm.	DGCI	2008	DBLP DOI BibTeX RDF
17	Hugo Gimbert, Florian Horn 0001	Solving Simple Stochastic Games.	CiE	2008	DBLP DOI BibTeX RDF
17	Xiaolin Shi, Matthew Bonner, Lada A. Adamic, Anna C. Gilbert	The very small world of the well-connected.	Hypertext	2008	DBLP DOI BibTeX RDF	graph compression, graph synopsis
17	Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte	On Dissemination Thresholds in Regular and Irregular Graph Classes.	LATIN	2008	DBLP DOI BibTeX RDF
17	Siu-Wing Cheng, Antoine Vigneron	Motorcycle Graphs and Straight Skeletons.	Algorithmica	2007	DBLP DOI BibTeX RDF
17	Sun-Yuan Hsieh, Pei-Yu Yu	Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Mutually independent Hamiltonian cycles, Hypercubes, Hamiltonian, Graph-theoretic interconnection networks, Fault-tolerant embedding
17	Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu	On the equitable k *-laceability of hypercubes.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Hamiltonian laceable, Hypercube, Container, Hamiltonian
17	Thomas Sauerwald	On Mixing and Edge Expansion Properties in Randomized Broadcasting.	ISAAC	2007	DBLP DOI BibTeX RDF
17	Asaf Shapira, Raphael Yuster, Uri Zwick	All-pairs bottleneck paths in vertex weighted graphs.	SODA	2007	DBLP BibTeX RDF
17	Shuhua Lai, Fuhua (Frank) Cheng, Fengtao Fan	Locally Adjustable Interpolation for Meshes of Arbitrary Topology.	ISVC (1)	2007	DBLP DOI BibTeX RDF
17	Xiaowei Xu 0001, Nurcan Yuruk, Zhidan Feng, Thomas A. J. Schweiger	SCAN: a structural clustering algorithm for networks.	KDD	2007	DBLP DOI BibTeX RDF	graph partitioning, outliers, community Structure, hubs, network clustering
17	Martin Harrigan, Patrick Healy	Efficiently drawing a significant spanning tree of a directed graph.	APVIS	2007	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender	A Cubic Kernel for Feedback Vertex Set.	STACS	2007	DBLP DOI BibTeX RDF
17	Dibin Zhou, Kangjian Wang, Lijun Xie, Yao Zheng	Projecting Tetrahedra with a Simplified Basis Graph.	IMSCCS	2007	DBLP DOI BibTeX RDF	four-vertex mapping, volume rendering, unstructured grids, project tetrahedra
17	Amos Korman, Shay Kutten	Labeling Schemes with Queries.	SIROCCO	2007	DBLP DOI BibTeX RDF	distance queries, Labeling schemes, routing schemes
17	Michael Behrisch 0002, Amin Coja-Oghlan, Mihyun Kang	Local Limit Theorems for the Giant Component of Random Hypergraphs.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
17	Huaming Zhang, Xin He	Optimal st -Orientations for Plane Triangulations.	AAIM	2007	DBLP DOI BibTeX RDF
17	Surender Baswana, Sandeep Sen	Approximate distance oracles for unweighted graphs in expected O(n2) time.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Approximate distance oracles, distance queries, shortest paths, distances, spanners
17	Venkatesh Raman 0001, Saket Saurabh 0001, C. R. Subramanian 0001	Faster fixed parameter tractable algorithms for finding feedback vertex sets.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	parameterized complexity, Feedback vertex set, girth
17	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	fault-Hamiltonicity, strong Hamiltonicity, recursive circulants, restricted HL-graphs, Fault tolerance, graph theory, embedding, network topology
17	Victor Chepoi, Feodor F. Dragan, Yann Vaxès	Addressing, distances and routing in triangular systems with applications in cellular networks.	Wirel. Networks	2006	DBLP DOI BibTeX RDF	Triangular systems, Cell identification code, Cell distance, Routing, Cellular networks, Location management
17	Shuhua Lai, Fuhua (Frank) Cheng	Similarity based interpolation using Catmull-Clark subdivision surfaces.	Vis. Comput.	2006	DBLP DOI BibTeX RDF	Catmull-Clark subdivision surfaces, Interpolation, Subdivision, Subdivision surfaces
17	László Babai	On the diameter of Eulerian orientations of graphs.	SODA	2006	DBLP DOI BibTeX RDF
17	David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng	On Probe Permutation Graphs.	TAMC	2006	DBLP DOI BibTeX RDF
17	Virginia Vassilevska, Ryan Williams 0001, Raphael Yuster	Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems.	ICALP (1)	2006	DBLP DOI BibTeX RDF
17	Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko	Computing the Diameter of 17-Pancake Graph Using a PC Cluster.	Euro-Par	2006	DBLP DOI BibTeX RDF
17	Tim Dwyer, Seok-Hee Hong 0001, Dirk Koschützki, Falk Schreiber, Kai Xu 0003	Visual analysis of network centralities.	APVIS	2006	DBLP DOI BibTeX RDF	social networks, visualisation, graph drawing, network analysis, centralities, biological networks
17	Chandra Chekuri, Martin Pál	An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
17	Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell	Eliminating Cycles in the Discrete Torus.	LATIN	2006	DBLP DOI BibTeX RDF
17	Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann	Complexity and Exact Algorithms for Multicut.	SOFSEM	2006	DBLP DOI BibTeX RDF
17	Sushmita Gupta, Venkatesh Raman 0001, Saket Saurabh 0001	Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems.	FSTTCS	2006	DBLP DOI BibTeX RDF
17	David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng	Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.	AAIM	2006	DBLP DOI BibTeX RDF
17	Hal A. Kierstead, Daqing Yang	Very Asymmetric Marking Games.	Order	2005	DBLP DOI BibTeX RDF	coloring number, competitive coloring, planar graph
17	Martin C. Cooper	Wireframe Projections: Physical Realisability of Curved Objects and Unambiguous Reconstruction of Simple Polyhedra.	Int. J. Comput. Vis.	2005	DBLP DOI BibTeX RDF	wireframe model, hidden-line drawing, physical realisability, impossible object, Necker cube, Penrose triangle
17	Yong-Bing Shi, Yin-Cai Tang, Hua Tang, Ling-Liu Gong, Li Xu	Two Classes of Simple MCD Graphs.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
17	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Fault-Hamiltonicity of Hypercube-Like Interconnection Networks.	IPDPS	2005	DBLP DOI BibTeX RDF
17	Jan Kyncl, Pavel Valtr 0001	On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.	GD	2005	DBLP DOI BibTeX RDF
17	David R. Wood	Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout.	Algorithmica	2004	DBLP DOI BibTeX RDF	Diagonal layout, Vertex-ordering, Book embedding, Graph drawing, Dimensional, Orthogonal
17	Ioan Alexandru Salomie, Adrian Munteanu 0001, Augustin Gavrilescu, Gauthier Lafruit, Peter Schelkens, Rudi Deklerck, Jan Cornelis 0001	MESHGRID-a compact, multiscalable and animation-friendly surface representation.	IEEE Trans. Circuits Syst. Video Technol.	2004	DBLP DOI BibTeX RDF
17	Catherine S. Greenhill, Andrzej Rucinski 0001, Nicholas C. Wormald	Random Hypergraph Processes with Degree Restrictions.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
17	Igor B. Bourdonov	Traversal of an Unknown Directed Graph by a Finite Robot.	Program. Comput. Softw.	2004	DBLP DOI BibTeX RDF
17	Igor B. Bourdonov	Backtracking Problem in the Traversal of an Unknown Directed Graph by a Finite Robot.	Program. Comput. Softw.	2004	DBLP DOI BibTeX RDF
17	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.	ISAAC	2004	DBLP DOI BibTeX RDF
17	Satoshi Fujita, Toru Araki	Three-Round Adaptive Diagnosis in Binary n-Cubes.	ISAAC	2004	DBLP DOI BibTeX RDF
17	Jan van den Heuvel, Matthew Johnson 0002	The External Network Problem with Edge- or Arc-Connectivity Requirements.	CAAN	2004	DBLP DOI BibTeX RDF
17	Yoichi Maeda	Visual Pascal Configuration and Quartic Surface.	JCDCG	2004	DBLP DOI BibTeX RDF
17	Victor Chepoi, Feodor F. Dragan, Yann Vaxès	Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.	IPDPS	2004	DBLP DOI BibTeX RDF
17	Byoung-Ju Yun, Si-Woong Lee, Jae-Soo Cho, Jae-Gark Choi, Hyun Soo Kang	A New Vertex Selection Scheme Using Curvature Information.	KES	2004	DBLP DOI BibTeX RDF
17	Vida Dujmovic, David R. Wood	Layouts of Graph Subdivisions.	GD	2004	DBLP DOI BibTeX RDF
17	Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan	Random Geometric Graph Diameter in the Unit Disk with lp Metric.	GD	2004	DBLP DOI BibTeX RDF
17	Haijun Zhou, Reinhard Lipowsky	Network Brownian Motion: A New Method to Measure Vertex-Vertex Proximity and to Identify Communities and Subcommunities.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
17	Jung-Heum Park	One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.	COCOON	2004	DBLP DOI BibTeX RDF
17	Toshinori Yamada	Fault-Tolerant Meshes with Constant Degree.	COCOON	2004	DBLP DOI BibTeX RDF
17	Dániel Marx	Parameterized Graph Separation Problems.	IWPEC	2004	DBLP DOI BibTeX RDF
17	Guantao Chen, Ronald J. Gould, Xingxing Yu	Graph Connectivity After Path Removal.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C40, 05C38
17	János Pach, József Solymosi, Géza Tóth 0001	Unavoidable Configurations in Complete Topological Graphs.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
17	Luc Brun, Walter G. Kropatsch	Construction of Combinatorial Pyramids.	GbRPR	2003	DBLP DOI BibTeX RDF
17	Béla Bollobás, Don Coppersmith, Michael Elkin	Sparse distance preservers and additive spanners.	SODA	2003	DBLP BibTeX RDF
17	Mauritsius Tuga, Mirka Miller	Delta-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.	IJCCGGT	2003	DBLP DOI BibTeX RDF
17	Vincent D. Blondel, Paul Van Dooren	Similarity Matrices for Pairs of Graphs.	ICALP	2003	DBLP DOI BibTeX RDF
17	Venkatesh Raman 0001, Saket Saurabh 0001	Parameterized Complexity of Directed Feedback Set Problems in Tournaments.	WADS	2003	DBLP DOI BibTeX RDF
17	Richard Cole 0001, Ramesh Hariharan	A fast algorithm for computing steiner edge connectivity.	STOC	2003	DBLP DOI BibTeX RDF	cactus trees, edge-connectivity, Steiner points
17	Tao Jiang 0003, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West	The Chromatic Spectrum of Mixed Hypergraphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
17	Michael U. Gerber, Pierre Hansen, Alain Hertz	Extension of Turán's Theorem to the 2-Stability Number.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
17	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning Trees of Supply and Demand.	ISAAC	2002	DBLP DOI BibTeX RDF	maximum partition problem, supply, algorithm, approximation, tree, demand, partition problem, FPTAS
17	Chie Nara, Toshinori Sakai, Jorge Urrutia	Maximal Number of Edges in Geometric Graphs without Convex Polygons.	JCDCG	2002	DBLP DOI BibTeX RDF
17	Douglas Antony Louis Piriyakumar, Paul Levi	A novel isomorphism based on nearest neighbours for efficient graph matching algorithm.	ICARCV	2002	DBLP DOI BibTeX RDF
17	Christof Löding	Model-Checking Infinite Systems Generated by Ground Tree Rewriting.	FoSSaCS	2002	DBLP DOI BibTeX RDF