Related papers: New results on path-decompositions and their down-…
Graph embedding based on random-walks supports effective solutions for many graph-related downstream tasks. However, the abundance of embedding literature has made it increasingly difficult to compare existing methods and to identify…
Let $G$ be a 4-chromatic maximal planar graph (MPG) with the minimum degree of at least 4 and let $C$ be an even-length cycle of $G$.If $|f(C)|=2$ for every $f$ in some Kempe equivalence class of $G$, then we call $C$ an unchanged…
Link prediction plays an important role in understanding intrinsic evolving mechanisms of networks. With the belief that the likelihood of the existence of a link between two nodes is strongly related with their similarity, many methods…
If $H$ is (or is isomorphic to) a subgraph of $G$, $H$ is said to {\it divide} $G$ if there is an edge-decomposition of $G$ by copies of $E(H)$, the edge set of $H$. A more restrictive version of this is when there is a subgroup ${\cal H}$…
In this paper, we study surfaces embedded in $4$-manifolds. We give a complete set of moves relating banded unlink diagrams of isotopic surfaces in an arbitrary $4$-manifold. This extends work of Swenton and Kearton-Kurlin in $S^4$. As an…
The prediction of graph evolution is an important and challenging problem in the analysis of networks and of the Web in particular. But while the appearance of new links is part of virtually every model of Web growth, the disappearance of…
The PWP map was introduced by the second author as a tool for ranking nodes in networks. In this work we extend this technique so that it can be used to rank links as well. Applying the Girvan-Newman algorithm a ranking method on links…
Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices are partitioned into subsets of size at most $h$, each…
Given a graph $G$, we associate a path matrix $P$ whose $(i, j)$ entry represents the maximum number of vertex disjoint paths between the vertices $i$ and $j$, with zeros on the main diagonal. In this note, we resolve four conjectures from…
Modelling how concepts are related is a central topic in Lexical Semantics. A common strategy is to rely on knowledge graphs (KGs) such as ConceptNet, and to model the relation between two concepts as a set of paths. However, KGs are…
This study investigates the properties of the 3-token graph derived from path graphs, with a particular focus on its structural characteristics and key attributes. We analyze how the 3-token graph is constructed from path graphs and explore…
We study the problem of desingularizing coassociative conical singularities via gluing, allowing for topological and analytic obstructions, and discuss applications. This extends the author's earlier work on the unobstructed case. We…
The path decomposition expansion is a path integral technique for decomposing sums over paths in configuration space into sums over paths in different spatial regions. It leads to a decomposition of the configuration space propagator across…
We present algorithms and experiments for the visualization of directed graphs that focus on displaying their reachability information. Our algorithms are based on the concepts of the path and channel decomposition as proposed in the…
Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by…
Network topology inference is a prominent problem in Network Science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known, and then analyze how the graph's algebraic and spectral characteristics…
In this paper we consider the complex uniformly resolvable decompositions of the complete graph $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set $\mathcal H$. We…
For a graph $G$ and $S\subset V(G)$, if $G - S$ is acyclic, then $S$ is said to be a decycling set of $G$. The size of a smallest decycling set of $G$ is called the decycling number of $G$. The purpose of this paper is a comprehensive…
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of…
Graph matching can be formalized as a combinatorial optimization problem, where there are corresponding relationships between pairs of nodes that can be represented as edges. This problem becomes challenging when there are potential…