Search results for "vertex"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Maxim Teslenko, Elena Dubrova	A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex.	CoRR	2015	DBLP BibTeX RDF
19	Robert Ryan McCune, Tim Weninger, Greg Madey	Thinking Like a Vertex: A Survey of Vertex-Centric Frameworks for Large-Scale Distributed Graph Processing.	ACM Comput. Surv.	2015	DBLP DOI BibTeX RDF
19	Primoz Potocnik, Pablo Spiga, Gabriel Verret	Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs.	J. Comb. Theory, Ser. B	2015	DBLP DOI BibTeX RDF
19	Keren Censor-Hillel, Mohsen Ghaffari 0001, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn	Tight Bounds on Vertex Connectivity Under Vertex Sampling.	SODA	2015	DBLP DOI BibTeX RDF
19	Amihood Amir, Benny Porat	On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling.	CPM	2015	DBLP DOI BibTeX RDF
19	Meirav Zehavi	Maximum Minimal Vertex Cover Parameterized by Vertex Cover.	MFCS (2)	2015	DBLP DOI BibTeX RDF
19	Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann	On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion.	Algorithmica	2014	DBLP DOI BibTeX RDF
19	Longjie Li 0001, Min Ma, Peng Lei, Mingwei Leng, Xiaoyun Chen	S2R&R2S: A framework for ranking vertex and computing vertex-pair similarity simultaneously.	J. Inf. Sci.	2014	DBLP DOI BibTeX RDF
19	Zhiwen Fang, Yang Chu, Kan Qiao, Xu Feng, Ke Xu 0001	Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem.	FAW	2014	DBLP DOI BibTeX RDF
19	Marek Cygan, Marcin Pilipczuk	Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms.	Inf. Process. Lett.	2013	DBLP DOI BibTeX RDF
19	Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle	Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
19	Sounaka Mishra, Ashwin Pananjady, N. Safina Devi	On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion.	CoRR	2013	DBLP BibTeX RDF
19	Wen Yu 0003, Frans Coenen, Michele Zito 0001, Subhieh El-Salhi	Vertex Unique Labelled Subgraph Mining for Vertex Label Classification.	ADMA (1)	2013	DBLP DOI BibTeX RDF
19	Huirong Bao, Zhiye Zhao	The vertex-to-vertex contact analysis in the two-dimensional discontinuous deformation analysis.	Adv. Eng. Softw.	2012	DBLP DOI BibTeX RDF
19	Cheryl E. Praeger, Pablo Spiga, Gabriel Verret	Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
19	Martin Doucha, Jan Kratochvíl	Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width.	MFCS	2012	DBLP DOI BibTeX RDF
19	Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman	On Vertex, Edge, and Vertex-Edge Random Graphs.	Electron. J. Comb.	2011	DBLP DOI BibTeX RDF
19	Hermann Gruber	Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees	CoRR	2011	DBLP BibTeX RDF
19	Hermann Gruber	Bounding the feedback vertex number of digraphs in terms of vertex degrees.	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
19	Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López	Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors.	J. Graph Theory	2011	DBLP DOI BibTeX RDF
19	Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman	On Vertex, Edge, and Vertex-edge Random Graphs.	ANALCO	2011	DBLP DOI BibTeX RDF
19	Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann	On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.	SOFSEM	2011	DBLP DOI BibTeX RDF
19	Romain Campigotto	Algorithmes d'approximation à mémoire limitée pour le traitement de grands graphes : le problème du Vertex Cover. (Approximation Algorithms with Low Memory Capacities for Large Graphs Processing : the Vertex Cover Problem).		2011	RDF
19	Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang	Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph.	J. Comput. Syst. Sci.	2010	DBLP DOI BibTeX RDF
19	Steve Kirkland	Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality.	Discret. Math.	2010	DBLP DOI BibTeX RDF
19	Cai Heng Li, Liang Niu, Ákos Seress, Ronald Solomon	The vertex primitive and vertex bi-primitive s-arc regular graphs.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
19	Loukas Georgiadis	Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs.	ICALP (1)	2010	DBLP DOI BibTeX RDF
19	Chang-Hyo Yu, Kyusik Chung, Donghyun Kim, Seok-Hoon Kim, Lee-Sup Kim	A 186-Mvertices/s 161-mW Floating-Point Vertex Processor With Optimized Datapath and Vertex Caches.	IEEE Trans. Very Large Scale Integr. Syst.	2009	DBLP DOI BibTeX RDF
19	René van Bevern	Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion	CoRR	2009	DBLP BibTeX RDF
19	Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle	Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions	CoRR	2009	DBLP BibTeX RDF
19	François Delbot	Au delà de l'évaluation en pire cas : comparaison et évaluation en moyenne de processus d'optimisation pour le problème du vertex cover et des arbres de connexion de groupes dynamiques. (Beyond the worst case evaluation: Comparison and average evaluation of optimization processes in the case of the vertex cover problem and trees connecting groups).		2009	RDF
19	E. A. Yusov, V. E. Turlapov	Adaptive terrain triangulation using the representation of quad trees by vertex textures and wavelet estimation of vertex significance.	Program. Comput. Softw.	2008	DBLP DOI BibTeX RDF
19	Chang-Hyo Yu, Kyusik Chung, Donghyun Kim, Lee-Sup Kim	An Energy-Efficient Mobile Vertex Processor With Multithread Expanded VLIW Architecture and Vertex Caches.	IEEE J. Solid State Circuits	2007	DBLP DOI BibTeX RDF
19	Yoshiyasu Ishigami	Vertex-disjoint cycles of length at most four each of which contains a specified vertex.	J. Graph Theory	2001	DBLP DOI BibTeX RDF
19	Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki	Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.	J. Comb. Optim.	2000	DBLP DOI BibTeX RDF
19	Ralf Klasing	The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width.	Discret. Appl. Math.	1998	DBLP DOI BibTeX RDF
19	Adi Bar-Lev, Ayal Itzkovitz, Alon Raviv, Assaf Schuster	Parallel Vertex-To-Vertex Radiosity on a Distributed Shared Memory System.	IRREGULAR	1998	DBLP DOI BibTeX RDF
19	Monika Rauch Henzinger	A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.	J. Algorithms	1997	DBLP DOI BibTeX RDF
19	Adi Bar-Lev, Ayal Itzkovitz, Alon Raviv, Assaf Schuster	Vertex-To-Vertex Parallel Radiosity on Clusters of PCs.	WAE	1997	DBLP BibTeX RDF
19	Toshihiro Fujito	A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach.	Inf. Process. Lett.	1996	DBLP DOI BibTeX RDF
19	Nelson L. Max, Michael J. Allison	Linear Radiosity Approximation using Vertex-to-Vertex Form Factors.	Graphics Gems III	1992	DBLP DOI BibTeX RDF
19	Heiko Harborth	Plane four-regular graphs with vertex-to-vertex unit triangles.	Discret. Math.	1991	DBLP DOI BibTeX RDF
19	László Babai	Vertex-transitive graphs and vertex-transitive maps.	J. Graph Theory	1991	DBLP DOI BibTeX RDF
19	S. H. Chuang, Mark R. Henderson	Three-dimensional shape pattern recognition using vertex classification and vertex-edge graphs.	Comput. Aided Des.	1990	DBLP DOI BibTeX RDF
19	Richard J. Nowakowski, Peter Winkler 0001	Vertex-to-vertex pursuit in a graph.	Discret. Math.	1983	DBLP DOI BibTeX RDF
19	Kabekode V. S. Bhat	Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing.	IEEE Trans. Syst. Man Cybern.	1980	DBLP DOI BibTeX RDF
18	André Renato Sales Amaral	A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Vertex ordering problems, Minimum linear arrangement, Integer programming
18	Michael Lampis, Valia Mitsou	The Ferry Cover Problem.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Wolf-goat-cabbage puzzle, Approximation algorithms, Graph algorithms, Vertex cover, Transportation problems
18	Ju Wang 0001, Jonathan C. L. Liu	Uplink relaying in hybrid wireless networks with out-of-cell interference reduction.	Wirel. Networks	2009	DBLP DOI BibTeX RDF	Uplink relaying, Out-cell-interference, Wireless network, WLAN, WCDMA, Vertex cover
18	Christos A. Athanasiadis	On the Graph Connectivity of Skeleta of Convex Polytopes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Balinski’s theorem, Incidence graph, Skeleton, Convex polytope, Cell complex, Vertex connectivity
18	Tammy M. K. Cheng, Yu-En Lu, Pietro Liò	Identification of structurally important amino acids in proteins by graph-theoretic measures.	KDD Workshop on Statistical and Relational Learning in Bioinformatics	2009	DBLP DOI BibTeX RDF	protein stability, graph theory, computational biology, vertex cover, protein structure
18	Kamrul Islam 0001, Selim G. Akl, Henk Meijer	Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks.	DCOSS	2009	DBLP DOI BibTeX RDF	Minimum Vertex-cut, Wireless Sensor Network, Distributed Algorithm, Maximal Clique
18	Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito	An improved constant-time approximation algorithm for maximum matchings.	STOC	2009	DBLP DOI BibTeX RDF	constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover
18	Venkatesh Raman 0001, Saket Saurabh 0001	Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles.	Algorithmica	2008	DBLP DOI BibTeX RDF	t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity
18	Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe	Efficient traversal of mesh edges using adjacency primitives.	ACM Trans. Graph.	2008	DBLP DOI BibTeX RDF	programmable geometry shader, vertex locality, real-time rendering, silhouettes, shadow volumes
18	David Avis, Bohdan Kaluzny	Computing monotone disjoint paths on polytopes.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy
18	Hatem Tahri, Mourad Elloumi	A New Approximation Algorithm for the Minimum Fragment Removal Problem.	BIRD	2008	DBLP DOI BibTeX RDF	haplotype assembly, minimum fragment removal, vertex bipartization, algorithms, complexities, Graphs
18	Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno	An Algorithm for L(2, 1)-Labeling of Trees.	SWAT	2008	DBLP DOI BibTeX RDF	frequency/channel assignment, L(2 and 1)-labeling, graph algorithm, vertex coloring
18	Rich Wareham, Joan Lasenby	Bone Glow: An Improved Method for the Assignment of Weights for Mesh Deformation.	AMDO	2008	DBLP DOI BibTeX RDF	skeletal animation, bone heat, bone glow, animation, skinning, mesh deformation, realtime, vertex weighting
18	Scott Schaefer, Tao Ju, Joe D. Warren	Manifold Dual Contouring.	IEEE Trans. Vis. Comput. Graph.	2007	DBLP DOI BibTeX RDF	contour simplification, Isosurfacing, manifold, vertex clustering
18	Paul S. Bonsma, Luis Cereceda	Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances.	MFCS	2007	DBLP DOI BibTeX RDF	vertex-recolouring, colour graph, superpolynomial distance, PSPACE-complete
18	Xiaona Zhang, Yunjie Zhang, Weina Wang 0002, Yi Li	A Novel Approach for Fuzzy Connected Image Segmentation.	ICFIE	2007	DBLP DOI BibTeX RDF	fuzzy connectedness, vertex set expanding, image segmentation, TABU search
18	Michael Lampis, Valia Mitsou	The Ferry Cover Problem.	FUN	2007	DBLP DOI BibTeX RDF	wolf-goat-cabbage puzzle, approximation algorithms, graph algorithms, vertex cover, transportation problems
18	Cornelis W. Oosterlee, Francisco José Gaspar Lorenz	Multigrid Methods for the Stokes System.	Comput. Sci. Eng.	2006	DBLP DOI BibTeX RDF	coupled relaxation, decoupled distributive relaxation, staggered grid, vertex-centered grid, system transformation, Multigrid, Stokes equations
18	Pablo Diaz-Gutierrez, Anusheel Bhushan, M. Gopi 0001, Renato Pajarola	Single-strips for fast interactive rendering.	Vis. Comput.	2006	DBLP DOI BibTeX RDF	Single-strip, Weighted perfect matching, Vertex cache, Hamiltonian cycle, Visibility culling
18	Shaun Bangay, Chantelle Morkel	Graph matching with subdivision surfaces for texture synthesis on surfaces.	Afrigraph	2006	DBLP DOI BibTeX RDF	vertex region matching, texture synthesis, subdivision surfaces, graph cut
18	Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb	Private approximation of search problems.	STOC	2006	DBLP DOI BibTeX RDF	private approximation, solution-list algorithm, vertex cover, secure computation
18	Vic Grout	Principles of Cost Minimisation in Wireless Networks.	J. Heuristics	2005	DBLP DOI BibTeX RDF	minimum connected vertex cover problem, node constraints, edge constraints, path constraints, load constraints, add algorithm, drop algorithm, wireless networks
18	Mingyou Hu, Abdul Hamid Sadka, Stewart Worrall, Ahmet M. Kondoz	Scalable shape coding of video objects using temporal prediction.	ICME	2005	DBLP DOI BibTeX RDF	scalable vertex-based shape coding scheme, temporal prediction, coarser layer, R-D performance, video objects, contour matching
18	André Diatta, Peter J. Giblin	Geometry of Isophote Curves.	Scale-Space	2005	DBLP DOI BibTeX RDF	Isophote curve, symmetry set, inflexion, skeleton, shape analysis, medial axis, vertex
18	Emad Y. Ramadan, Arijit Tarafdar, Alex Pothen	A Hypergraph Model for the Yeast Protein Complex Network.	IPDPS	2004	DBLP DOI BibTeX RDF	protein complex network, power-law network, graph core, hypergraph, vertex cover, small-world network
18	Stefan Porschen, Ewald Speckenmeyer	Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
18	Keqin Li	Performance Evaluation of Heuristic Algorithms for Wavelength Assignment in WDM Optical Networks.	ICPP Workshops	2004	DBLP DOI BibTeX RDF	Average-case performance, heuristic, mesh, optical network, wavelength division multiplexing, wavelength assignment, random network, vertex coloring
18	Radoslaw Mantiuk, Karina Murawko-Wisniewska, Dorota Zdrojewska	Interactive Visualization of Relativistic Effects with the Hardware Acceleration.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF	rendering of relativistic effects, vertex and pixel shaders, interactive image synthesis, computer graphics
18	Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer	What cannot be computed locally!	PODC	2004	DBLP DOI BibTeX RDF	approximation hardness, distributed algorithms, locality, lower bounds, dominating set, vertex cover, maximal independent set, maximal matching
18	Ryuhei Uehara	Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.	ICALP	2002	DBLP DOI BibTeX RDF	Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms
18	Shuntaro Yamazaki, Kiwamu Kase, Katsushi Ikeuchi	Interactive Visualization of Non-Manifold Implicit Surfaces Using Pre-Integrated Volume Rendering .	PG	2002	DBLP DOI BibTeX RDF	segmented distance, vertex generation diagram, volume rendering, implicit surfaces, non-manifold
18	Alessandro Panconesi, Romeo Rizzi	Some simple distributed algorithms for sparse networks.	Distributed Comput.	2001	DBLP DOI BibTeX RDF	Vertex colouring, Edge colouring, Distributed computing, Maximal independent set, Sparse networks, Maximal matching
18	Lu Ruan 0001, Ding-Zhu Du, Xiao-Dong Hu 0001, Xiaohua Jia, Deying Li 0001, Zheng Sun	Converter Placement Supporting Broadcast in WDM Optical Networks.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	converter placement, Color-Covering, Vertex Color-Covering, optical networks, WDM, Network optimization
18	Maytham Safar, Cyrus Shahabi, Cheng-Hai Tan	Resiliency and Robustness of Alternative Shape-Based Image Retrieval.	IDEAS	2000	DBLP DOI BibTeX RDF	shape-based image retrieval techniques, multimedia similarity retrieval, shape representation techniques, shape-based object retrieval, retrieval accuracy, MBC-TPVAS, minimum bounding circle, touch-point vertex-angle sequence, performance, robustness, image retrieval, uncertainty, noise, resiliency, precision, discrepancies, human perception, recall, corner points
18	Marc Alexa, Daniel Cohen-Or, David Levin	As-rigid-as-possible shape interpolation.	SIGGRAPH	2000	DBLP DOI BibTeX RDF	compatible triangulation, vertex path problem, shape blending
18	Han Ju Yu, Jong Beom Ra	Fast triangular mesh approximation of surface data using wavelet coefficients.	Vis. Comput.	1999	DBLP DOI BibTeX RDF	Triangular mesh approximation, Vertex removal, Terrain data, Wavelet transform, 3D visualization
18	Aiguo Xie, Peter A. Beerel	Accelerating Markovian Analysis of Asynchronous Systems using String- based State Compression.	ASYNC	1998	DBLP DOI BibTeX RDF	stationary analysis, state compression, performance evaluation, Asynchronous systems, power estimation, convergence rate, Markov chain models, feedback vertex set
18	Claus B. Madsen	A comparative study of the robustness of two pose estimation techniques.	Mach. Vis. Appl.	1997	DBLP DOI BibTeX RDF	Robustness, Noise, Pose estimation, Sensitivity, Viewpoint, Vertex
18	Daniela Ferrero, Carles Padró	Fault-Tolerant Routings in Large Generalized Cycles.	SCCC	1997	DBLP DOI BibTeX RDF	fault-tolerant routing algorithms, de Bruijn generalized cycles, Kautz generalized cycles, generalized p-cycle, vertex set partitioning, faulty elements, directed graphs, diameter, digraph, ordered set, path length
18	Oswaldo Vernet, Lilian Markenzon	Hamiltonian Problems for Reducible Flowgraphs.	SCCC	1997	DBLP DOI BibTeX RDF	Hamiltonian problems, reducible flowgraphs, unique Hamiltonian cycle, source vertex, Hamiltonian cycle, Hamiltonian path, flow graphs
18	Marcelo M. de Azevedo, Nader Bagherzadeh, Shahram Latifi	Fault-diameter of the star-connected cycles interconnection network.	HICSS (2)	1995	DBLP DOI BibTeX RDF	star-connected cycles interconnection network, maximum diameter, fault-free, fixed constant, fault tolerance, reliability, graph theory, parallel architectures, fault tolerant computing, graph, multiprocessor interconnection networks, vertex connectivity, fault-diameter
18	Sabine R. Öhring, Falguni Sarkar, Sajal K. Das 0001, Dirk H. Hohndel	Cayley graph connected cycles: A new class of fixed-degree interconnection networks.	HICSS (2)	1995	DBLP DOI BibTeX RDF	Cayley graph connected cycles, fixed-degree interconnection networks, vertex-symmetric networks, maximally fault tolerant networks, abelian generator-sets, graph theory, fault tolerant computing, multiprocessor interconnection networks, routing algorithms, hypercube networks, network routing, broadcasting algorithms, cube-connected cycles, average distance
18	Anthony D. Johnson	On locally optimal breaking of nondisjoint cyclic vertical constraints in VLSI channel routing.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	locally optimal breaking strategy, nondisjoint cyclic vertical constraints, VLSI channel routing, vertical constraint graph, nondisjoint circuits, common vertex, common path, channel router heuristics, automatic routers, interactive routers, VLSI, graph theory, parallel architectures, network routing, circuit layout CAD, integrated circuit layout
18	Eiichi Tanaka	A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	unrooted trees, unordered trees, bottom-up computing method, strongly structure-preserving mapping, vertex correspondences, similar substructures, similar structure search, pattern recognition, computational complexity, dynamic programming, dynamic programming, pattern matching, pattern matching, similarity, time complexity, trees (mathematics), space complexity, distance metric, maximum degrees
18	Alain Cournier, Michel Habib	A New Linear Algorithm for Modular Decomposition.	CAAP	1994	DBLP DOI BibTeX RDF	autonomous subsets, clans, graph decomposition trees, vertex-splitting. cotrees, Graphs, modules, substitution, cographs, prime graphs
18	Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-Phong Vo	A Technique for Drawing Directed Graphs.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	four-pass algorithm, optimal rank assignment, network simplex algorithm, vertex order, iterative heuristic, novel weight function, local transpositions, optimal coordinates, auxiliary graph, computer graphics, optimisation, directed graphs, directed graphs, splines, splines (mathematics)
18	John M. Gauch, Stephen M. Pizer	Multiresolution Analysis of Ridges and Valleys in Grey-Scale Images.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	geophysical techniques, multiresolution behavior, vertex curves, global drainage patterns, watershed boundaries, geophysical techniques, rain, topography (Earth), image segmentation, remote sensing, remote sensing, differential geometry, differential geometry, ridges, terrain map, interactive image segmentation, valleys, rainfall, geophysics computing, grey-scale images
18	Chuan-Heng Ang, Hanan Samet, Clifford A. Shaffer	A New Region Expansion for Quadtrees.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	region expansion, one-pass algorithm, white pixels, black mode, black nodes, merging cluster, vertex set, pattern recognition, pattern recognition, picture processing, trees (mathematics), quadtrees
18	Ziv Gigus, Jitendra Malik	Computing the Aspect Graph for Line Drawings of Polyhedral Objects.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	3D object representation, edge projection, accidental viewpoints, pattern recognition, pattern recognition, computational geometry, graph theory, picture processing, picture processing, geometry, line drawings, aspect graph, vertex, polyhedral objects, Gaussian sphere
18	Jason S. J. Chen, Victor O. K. Li	Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	fragmented database systems, broadcast local network, minimum-weight vertex cover, join-analysis graph, parallelism, relational databases, distributed databases, concurrency control, redundancy, local area networks, NP hardness, relations
18	R. T. Jacob, Ivor P. Page	Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	mutual exclusion solutions, binary semaphores, graphical form, mutual exclusion constraint, edge semaphore solution, edge solvable, entry, exit sections, graph theory, operating systems (computers), graph grammar, efficient algorithm, vertex, forbidden subgraph, mutual exclusion problem
15	Ran Duan, Seth Pettie	Connectivity oracles for failure prone graphs.	STOC	2010	DBLP DOI BibTeX RDF	connectivity
15	Sharon Marko, Dana Ron	Approximating the distance to properties in bounded-degree and general sparse graphs.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Sublinear approximation algorithms, property testing, graph properties, distance approximation
15	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.	Algorithmica	2009	DBLP DOI BibTeX RDF	Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs