5 Hits in 6.4 sec

Local algorithms for hierarchical dense subgraph discovery

Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
2018 Proceedings of the VLDB Endowment  
Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical relations.  ...  In addition, we prove convergence bounds on the number of iterations. We present a framework of local algorithms to obtain the core, truss, and nucleus decompositions.  ...  Unifying k-core and k-truss: Nucleus decomposition is a framework that generalizes core and truss decompositions [37] . k-(r, s) nucleus is defined as the maximal subgraph of the rcliques where each r-clique  ... 
doi:10.14778/3275536.3275540 fatcat:35tj3bz7rfe5bdy3lwjmfbdjj4

Subject Index to Volumes 1–75

2001 Information Processing Letters  
, 2534, 3446 3-coloring, 2340, 2808 a graph, 1001 of a planar graph, 353 3-colourable, 3651 3-colouring, 3651 3-competitive, 4100 3-connected, 2058 graph, 441, 2058 3-connectivity, 1926 3-D, see also  ...  , 2136 in the plane, 1044 motion of a disk head, 63 particle in a stream, 22 motion planning, 1044, 1599, 1779, 1826, 2142, 2744, 3131, 3406, 3731 Motzkin, 858 algorithm, 858 mountainous terrain  ...  matrix, 3196 order n matrices, 623 tensors, 719 the adjacency matrix of a line graph, 252 rank one matrices, 1164 matrix, 472 rank queries, 1761 r decision trees, 2406 rankable set, 3245 ranked, 1610  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

Proceedings of the 2022 Joint Workshop of the German Research Training Groups in Computer Science

Felix Freiling, Helmut Seidl, 2022 2022 Joint Workshop Of The German Research Training Groups In Computer Science June 12–June 15
Returning to Dagstuhl and hosting this meeting as an in-person-only event was a deliberate decision to revive interaction modes that many of the funded researchers had yet to experience: fostering personal  ...  (DFG) in the field of computer science returns to Schloss Dagstuhl --– Leibniz Center for Informatics, one of the world's premier venues for computer science-related seminars.  ...  One way to define such a class is through focusing on induced subgraphs. A graph H is said to be an induced subgraph of a graph G if it can be obtained from G after only removing a set of vertices.  ... 
doi:10.25593/opus4-fau-19321 fatcat:ry4vd32xxbgldirrvymuaxxqwi

ADVCOMP 2013 Technical Program Committee

Witold Abramowicz, H Metin Aktulga, Lawrence Berkeley, National Lab, Gabriel Amorós, Universitat De València, Spain Sulieman, Bani-Ahmad Al-Balqa, Applied University, Jordan Beraldi, La Sapienza, Mario Berón (+73 others)
The conference provided a forum where researchers were able to present recent research results and new research problems and directions related to them.  ...  We are grateful to the members of the ADVCOMP 2013 organizing committee for their help in handling the logistics and for their work to make this professional meeting a success.  ...  Matthias Makulla did most of the implementation work on several parallel graph algorithms including an initial version of the ones used in this paper.  ... 

Two technologies for single-molecule proteomics, three technologies for image analysis

Alexander Alexeyvich Boulgakov, 0000-0002-7446-1120, Austin, The University Of Texas At, Edward M. Marcotte
We demonstrate a working proof-of-concept for fluorosequencing, and significant progress towards a proof-of-concept for reverse translation.  ...  Being able to detect and quantify proteins in various circumstances such as in biochemically fractionated cellular lysates has proven to be highly informative about their characteristics, functions, and  ...  Rybarski for assistance with image analysis, A. Ellington for many  ... 
doi:10.26153/tsw/41825 fatcat:5cswix75onbrzjxpbptltqbi4q