research
∙
07/04/2023
An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number
Since Jacobson [FOCS89] initiated the investigation of succinct graph en...
share
research
∙
03/06/2023
A Simple 2-Approximation for Maximum-Leaf Spanning Tree
For an m-edge connected simple graph G, finding a spanning tree of G wit...
research
∙
07/15/2022
Improved Algorithms for Recognizing Perfect Graphs and Finding Shortest Odd and Even Holes
Various classes of induced subgraphs are involved in the deepest results...
research
∙
09/30/2021
Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
For vertices u and v of an n-vertex graph G, a uv-trail of G is an induc...
research
∙
08/15/2020
Finding a Shortest Even Hole in Polynomial Time
An even (respectively, odd) hole in a graph is an induced cycle with eve...
research
∙
09/16/2019
Three-in-a-Tree in Near Linear Time
The three-in-a-tree problem is to determine if a simple undirected graph...
research
∙
01/27/2001
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
Let G be an embedded planar undirected graph that has n vertices, m edge...
research
∙
01/23/2001