Login / Signup
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders.
Loukas Georgiadis
Giuseppe F. Italiano
Aikaterini Karanasiou
Published in:
SEA (2017)
Keyphrases
</>
high levels
high sensitivity
wide range
significantly lower
highly correlated
high noise
high rate
small size
graph mining
database
connected components
special case
xml documents
information systems
low signal to noise ratio
data mining
vertex set
labeled graphs
neural network