Network Analysis
From MaRDI portal
Publication:5703981
DOI10.1007/b106453zbMath1118.68332OpenAlexW4248776151MaRDI QIDQ5703981
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106453
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
Isolation concepts for efficiently enumerating dense subgraphs ⋮ Inequalities for the number of walks in graphs ⋮ Matrix power inequalities and the number of walks in graphs ⋮ Editing graphs into disjoint unions of dense clusters ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ In search of the densest subgraph ⋮ The self-consistent determination of HF electroconductivity of strongly coupled plasmas ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
This page was built for publication: Network Analysis
