首页/论文/2003.04280

arXiv 2003.042802020-03cs.DScs.DCmath.CO

Adjacency Labelling for Planar Graphs (and Beyond)

Vida Dujmović, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin

备注：: v4: referees' comments incorporated v3: minor changes v2: significant revision v1: 35 pages; 8 figures
发表信息：: Journal of the ACM, 68/6:Article 42, 2021
DOI：: 10.1145/3477542

英文摘要：

We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an $n$-vertex planar graph $G$ is assigned a $(1+o(1))\log_2 n$-bit label and the labels of two vertices $u$ and $v$ are sufficient to determine if $uv$ is an edge of $G$. This is optimal up to the lower order term and is the first such asymptotically optimal result. An alternative, but equivalent, interpretation of this result is that, for every $n$, there exists a graph $U_n$ with $n^{1+o(1)}$ vertices such that every $n$-vertex planar graph is an induced subgraph of $U_n$. These results generalize to bounded genus graphs, apex-minor-free graphs, bounded-degree graphs from minor closed families, and $k$-planar graphs.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Optimal labelling schemes for adjacency, comparability, and reachability

We construct asymptotically optimal adjacency labelling schemes for every hereditary class containing $2^{Ω(n^2)}$ $n$-vertex graphs as $n\to \infty$. This regime contains many classes of interest, for instance perfect graphs or comparability graphs, for which we obtain an adjacency labelling scheme with labels of $n/4+o(n)$ bits per vertex. This implies the existence of a reachability labelling scheme for digraphs with labels of $n/4+o(n)$ bits per vertex and comparability labelling scheme for posets with labels of $n/4+o(n)$ bits per element. All these results are best possible, up to the lo…

2021-06-03cs.DSmath.CO

A Fast Algorithm for the Product Structure of Planar Graphs

Dujmović et al (FOCS2019) recently proved that every planar graph $G$ is a subgraph of $H\boxtimes P$, where $\boxtimes$ denotes the strong graph product, $H$ is a graph of treewidth 8 and $P$ is a path. This result has found numerous applications to linear graph layouts, graph colouring, and graph labelling. The proof given by Dujmović et al is based on a similar decomposition of Pilipczuk and Siebertz (SODA2019) which is constructive and leads to an $O(n^2)$ time algorithm for finding $H$ and the mapping from $V(G)$ onto $V(H\boxtimes P)$. In this note, we show that this algorithm can be mad…

2020-12-14cs.DSmath.CO

Near-Optimal Compression for the Planar Graph Metric

The Planar Graph Metric Compression Problem is to compactly encode the distances among $k$ nodes in a planar graph of size $n$. Two naïve solutions are to store the graph using $O(n)$ bits, or to explicitly store the distance matrix with $O(k^2 \log{n})$ bits. The only lower bounds are from the seminal work of Gavoille, Peleg, Prennes, and Raz [SODA'01], who rule out compressions into a polynomially smaller number of bits, for {\em weighted} planar graphs, but leave a large gap for unweighted planar graphs. For example, when $k=\sqrt{n}$, the upper bound is $O(n)$ and their constructions imply…

2017-03-14cs.DS

Shorter Labeling Schemes for Planar Graphs

An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent can be determined by a fixed procedure that examines only their labels. It is known that planar graphs with $n$ vertices admit a labeling scheme with labels of bit length $(2+o(1))\log{n}$. In this work we improve this bound by designing a labeling scheme with labels of bit length $(\frac{4}{3}+o(1))\log{n}$. In graph-theoretical terms, this implies an explici…

2020-04-17cs.DS

Contracting a Planar Graph Efficiently

We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in $O(1)$ time. Moreover, it can report all the arising self-loops and parallel edges. By applying the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar…

2017-06-30cs.DS

A Complexity Theory for Labeling Schemes

In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of its vertex labels. Due to the shortness constraint on the labels such schemes provide space-efficient representations for various graph classes, such as planar or interval graphs. We consider what graph classes cannot be represented by labeling schemes when the algorithm which determines adjacency is subjected to computational constraints.

2018-02-08cs.CCcs.DS

更多相关论文收起更多论文

The Space Complexity of Sum Labelling

A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels is the label of another vertex of the graph. Most papers on sum graphs consider combinatorial questions like the minimum number of isolated vertices that need to be added to a given graph to make it a sum graph. In this paper, we initiate the study of sum graphs from the viewpoint of computational complexity. Notice that every $n$-vertex sum graph can be represented by a sorted list of $n$ positive integers where edge…

2022-01-05cs.CCcs.DS

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G which all take O(m+n) time for encoding and decoding. Our schemes employ new properties of canonical orderings for planar graphs and new techniques of processing strings of multiple types of parentheses. For applications that need to determine in O(1) time the adjacency of two nodes and the degree of a node, we use 2m+(5+1/k)n + o(m+n) bits for any constant k > 0 while the best previous bound by Munro and Raman is 2m…

2001-02-08cs.DMcs.DS

Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms

The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph $G$ such that we may support insertions and deletions of edges in $G$ as well as distance queries between any two nodes $u,v$ subject to the constraint that the graph remains planar at all times. This problem has been extensively studied in both the theory and experimental communities over the past decades and gets solved millions of times every day by companies like Google, Microsoft, and Uber. The best known algorithm performs queries and updates in $\tilde{O}(n^{2/3})$ time, based on ideas of a seminal …

2016-05-12cs.CCcs.DS

支持次图操作的精简平面图编码

Succinct Planar Encoding with Minor Operations

本文提出一种仅用 $\mathcal{H}(n)+o(n)$ 比特空间的平面图精简编码，支持边收缩、顶点删除等次图操作及常数时间邻域查询，并基于此给出线性时间外平面性测试算法。

2024-01-17cs.DS

图同构问题的连续优化方法

Continuous optimization methods for the graph isomorphism problem

针对图同构问题，本文分析正交与双随机松弛解空间的几何性质，指出重复特征值增加复杂度，并提出基于Frank-Wolfe的连续优化方法，在高度对称图上验证了有效性。

2025-03-17cs.DMcs.DS

线性邻域复杂度类中的时间最优APSP与矩阵乘法

Time-Optimal APSP and Matrix Multiplication in Classes of Linear Neighborhood Complexity

CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR 5668（法国国家科学研究中心、里昂高等师范学校、克莱德·贝尔纳·里昂第一大学、LIP联合研究单位）；Institute of Informatics, University of Warsaw（华沙大学信息学研究所）；Max Planck Institute for Informatics, Saarland Informatics Campus（马克斯·普朗克 informatics 研究所、萨尔兰 informatics 校园）

该研究针对线性邻域复杂度类图，提出了时间最优的APSP与矩阵乘法算法，解决了相关领域的多个问题并扩展了结果，还给出了三角形、K₄、K₅检测的高效算法。

2026-08-27cs.CCcs.DMcs.DS

基于有效电阻查询的图推断

Graph Inference with Effective Resistance Queries

University of Colorado Boulder（科罗拉多大学博尔德分校）；University of California San Diego（加利福尼亚大学圣迭戈分校）；Oregon State University（俄勒冈州立大学）

本文研究利用有效电阻预言机进行图推断，提出测试树、双连通性等性质的O(n)查询算法，以及重构算法，并证明ER查询与最短路径查询能力不可比较。

2025-02-25cs.DMcs.DScs.LG