相关论文: Closing the Gap Between Directed Hopsets and Short…

Given two graphs $G$ and $H$, we define $\textsf{v-cover}_{H}(G)$ (resp. $\textsf{e-cover}_{H}(G)$) as the minimum number of vertices (resp. edges) whose removal from $G$ produces a graph without any minor isomorphic to ${H}$. Also…

Let $\alpha(G)$ and $\beta(G)$, denote the size of a largest independent set and the clique cover number of an undirected graph $G$. Let $H$ be an interval graph with $V(G)=V(H)$ and $E(G)\subseteq E(H)$, and let $\phi(G,H)$ denote the…

A regular graph $G = (V,E)$ is an $(\varepsilon,\gamma)$ small-set expander if for any set of vertices of fractional size at most $\varepsilon$, at least $\gamma$ of the edges that are adjacent to it go outside. In this paper, we give a…

An edge subset \( S \subseteq E(G) \) is called a 3-restricted edge-cut if \( G - S \) is disconnected and each component of \( G - S \) contains at least three vertices. The 3-restricted edge-connectivity of a graph \( G \), denoted by \(…

In established network architectures, shortcut connections are often used to take the outputs of earlier layers as additional inputs to later layers. Despite the extraordinary effectiveness of shortcuts, there remain open questions on the…

A geodesic is a shortest path which connects a pair of vertices of a graph G. In this paper we define the geodesic subpath number gpn(G) of a graph G as the number of geodesics in G. The number of subtrees and subpaths are already studied…

Let $G=(V,E)$ be a graph. An ordering of $G$ is a bijection $\alpha: V\dom \{1,2,..., |V|\}.$ For a vertex $v$ in $G$, its closed neighborhood is $N[v]=\{u\in V: uv\in E\}\cup \{v\}.$ The profile of an ordering $\alpha$ of $G$ is…

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

Let $G$ be a directed graph with $n$ vertices and $m$ edges, embedded on a surface $S$, possibly with boundary, with first Betti number $\beta$. We consider the complexity of finding closed directed walks in $G$ that are either contractible…

It is known for many algorithmic problems that if a tree decomposition of width $t$ is given in the input, then the problem can be solved with exponential dependence on $t$. A line of research by Lokshtanov, Marx, and Saurabh [SODA 2011]…

The direct product of graphs $G=(V(G),E(G))$ and $H=(V(H),E(H))$ is the graph, denoted as $G\times H$, with vertex set $V(G\times H)=V(G)\times V(H)$, where vertices $(x_1,y_1)$ and $(x_2,y_2)$ are adjacent in $G\times H$ if $x_1x_2\in…

A $t$-spanner of a graph $G=(V,E)$ is a subgraph $H=(V,E')$ that contains a $uv$-path of length at most $t$ for every $uv\in E$. It is known that every $n$-vertex graph admits a $(2k-1)$-spanner with $O(n^{1+1/k})$ edges for $k\geq 1$. This…

A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. In the graph homomorphism problem, denoted by $Hom(H)$, the graph $H$ is fixed and we need to determine if there exists a homomorphism from…

Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…

Let G be a weighted (directed) graph with n vertices and m edges. Given a source vertex s, Dijkstra's algorithm computes the shortest path lengths from s to all other vertices in O(m + n log n) time. This bound is known to be worst-case…

A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$, no neighbor of $v$ is further away from $u$ than $v$. The boundary $\partial(G)$ of $G$ is the set of all of its boundary…

Let $G$ be a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…

A monitoring edge-geodetic set, or simply an MEG-set, of a graph $G$ is a vertex subset $M \subseteq V(G)$ such that given any edge $e$ of $G$, $e$ lies on every shortest $u$-$v$ path of $G$, for some $u,v \in M$. The monitoring…

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the…

In the last decade, there has been a substantial amount of research in finding routing algorithms designed specifically to run on real-world graphs. In 2010, Abraham et al. showed upper bounds on the query time in terms of a graph's highway…