search result

Cover von Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs

Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs

Year: 2022
Media group: LIPIcs
Cover von A Study of Weisfeiler-Leman Colorings on Planar Graphs

A Study of Weisfeiler-Leman Colorings on Planar Graphs

Year: 2022
Media group: LIPIcs
Cover von On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs

On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs

Year: 2022
Media group: LIPIcs
Cover von Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs

Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs

Year: 2022
Media group: LIPIcs
Cover von A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks

A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks

Year: 2022
Media group: LIPIcs
Cover von A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs

A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs

Year: 2022
Media group: LIPIcs
Cover von Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees

Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees

Year: 2022
Media group: LIPIcs
Cover von Automatic Root Cause Quantification for Missing Edges in JavaScript Call Graphs

Automatic Root Cause Quantification for Missing Edges in JavaScript Call Graphs

Year: 2022
Media group: LIPIcs
Cover von Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives

Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives

Year: 2022
Media group: LIPIcs
Cover von Almost Shortest Paths with Near-Additive Error in Weighted Graphs

Almost Shortest Paths with Near-Additive Error in Weighted Graphs

Year: 2022
Media group: LIPIcs
OPEN V 11.1.0.0