The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
From MaRDI portal
Recommendations
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Extended dynamic subgraph statistics using h-index parameterized data structures
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
- A note on the H index in random networks
- The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs
- Subgraph statistics in subcritical graph classes
- On the Hosoya index of graphs
- A dynamic data structure for counting subgraphs in sparse graphs
- THE HARARY INDEX OF A GRAPH UNDER PERTURBATION
Cited in
(23)- Multivariate algorithmics for finding cohesive subnetworks
- Hardness and tractability of the \(\gamma\)-complete subgraph problem
- Hereditary classes of graphs: a parametric approach
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Win-win kernelization for degree sequence completion problems
- Positional dominance: concepts and algorithms
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Extended dynamic subgraph statistics using h-index parameterized data structures
- The Micro-world of Cographs
- Assessing the computational complexity of multi-layer subgraph detection
- Quasipolynomiality of the Smallest Missing Induced Subgraph
- Computing dense and sparse subgraphs of weakly closed graphs
- Graph parameters, implicit representations and factorial properties
- Parameterized local search for vertex cover: when only the search radius is crucial
- Can local optimality be used for efficient data reduction?
- Towards optimal dynamic indexes for approximate (and exact) triangle counting
- Temporal dominating set and temporal vertex cover under the lens of degree restrictions
- Timeline problems in temporal graphs: vertex cover vs. dominating set
- The parameter report: an orientation guide for data-driven parameterization
- Recent advances in fully dynamic graph algorithms (invited talk)
- Fully dynamic four-vertex subgraph counting
- The micro-world of cographs
This page was built for publication: The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143753)
