Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
vertex selection
Description:
The process or method of choosing vertices in a graph or geometric representation, used in graph analysis, shape processing, and computational geometry.
Related topics:
Complexity and Algorithms in Graphs (14%),
Computational Geometry and Mesh Generation (8%),
Computer Graphics and Visualization Techniques (8%),
Advanced Graph Theory Research (7%)
OpenAlex ID:
keywords/vertex-selection
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
2002
·
J. W. Raymond
·
The Computer Journal
·
375
PDF
DivRank: the interplay of prestige and diversity in information networks
2010
·
Qiaozhu Mei
, Jian Guo
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
207
A branch and bound algorithm for the maximum clique problem
1992
·
Panos M. Pardalos
, Gregory P. Rodgers
·
Computers & Operations Research
·
171
Parallel subgraph listing in a large-scale graph
2014
·
Yingxia Shao
, Bin Cui
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
143
Finding Near-Optimal Independent Sets at Scale
2015
·
Sebastian Lamm
, Peter Sanders
, et al.
·
Journal of Heuristics
·
141
PDF
Watermarking mesh-based representations of 3-D objects using local moments
2006
·
A.G. Bors
·
IEEE Transactions on Image Processing
·
108
Chebyshev approximation for two-dimensional nonrecursive digital filters
1975
·
Y. Kamp
, J. Thiran
·
IEEE Transactions on Circuits and Systems
·
105
Approximating the maximum vertex/edge weighted clique using local search
2007
·
Wayne Pullan
·
Journal of Heuristics
·
98
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
2010
·
Ferhat Ay
, Manolis Kellis
, et al.
·
Journal of Computational Biology
·
87
PDF
Searching for Maximum Cliques with Ant Colony Optimization
2003
·
Serge Fenet
, Christine Solnon
·
Lecture notes in computer science
·
82
Phased local search for the maximum clique problem
2006
·
Wayne Pullan
·
Journal of Combinatorial Optimization
·
79
Joint semantic–geometric learning for polygonal building segmentation from high-resolution remote sensing images
2023
·
Weijia Li
, Wenqian Zhao
, et al.
·
ISPRS Journal of Photogrammetry and Remote Sensing
·
72
SilSketch: automated sketch-based editing of surface meshes
2007
·
Johannes Zimmermann
, Andrew Nealen
, et al.
·
Sketch Based Interfaces and Modeling
·
64
Cooperating local search for the maximum clique problem
2010
·
Wayne Pullan
, Franco Mascia
, et al.
·
Journal of Heuristics
·
61
The 4/5 upper bound on the game total domination number
2016
·
Michael A. Henning
, Sandi Klavžar
, et al.
·
COMBINATORICA
·
60
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
2009
·
Wayne Pullan
·
Discrete Optimization
·
55
The maximum vertex coverage problem on bipartite graphs
2013
·
Nicola Apollonio
, Bruno Simeone
·
Discrete Applied Mathematics
·
54
PDF
Diversifying Citation Recommendations
2014
·
Onur Küçüktunç
, Erik Saule
, et al.
·
ACM Transactions on Intelligent Systems and Technology
·
53
A non-parametric sequential method for polygonal approximation of digital curves
1994
·
Bimal Kr. Ray
, Kumar S. Ray
·
Pattern Recognition Letters
·
44
A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem
2016
·
Ruizhi Li
, Shuli Hu
, et al.
·
Neural Computing and Applications
·
39
Global seamline networks for orthomosaic generation via local search
2013
·
Steven Mills
, Philip McLeod
·
ISPRS Journal of Photogrammetry and Remote Sensing
·
38
A better list heuristic for vertex cover
2008
·
François Delbot
, Christian Laforest
·
Information Processing Letters
·
32
Using a mobile phone for 6 DOF mesh editing
2007
·
Anders Henrysson
, Mark Billinghurst
·
28
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
2021
·
Daniel Dörfler
, Andreas Löhne
, et al.
·
Optimization methods & software
·
27
PDF
A linear time pattern matching algorithm between a string and a tree
2005
·
Tatsuya Akutsu
·
Springer eBooks
·
27
Show more works
View as search
Works count:
260
Citation count:
3,105
Year
Topic
Type