C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets.
Eduard Eiben
Danny Hermelin
M. S. Ramanujan
Published in:
J. Comput. Syst. Sci. (2019)
Keyphrases
</>
preprocessing
feature extraction
data structure
post processing
preprocessing step
markov chain
neural network
subgraph mining
data sets
convex sets
graph mining
connected components
random walk
xml documents
data streams
information systems
machine learning