Directed Graph Embeddings

11/06/2017
by   Reshef Meir, et al.
0

Definitions of graph embeddings and graph minors for directed graphs are introduced. For the class of 2-terminal directed acyclic graphs (TDAGs) the definitions coincide, and the class is closed under both operations. The usefulness of the directed embedding operation is demonstrated be characterizing all TDAGs with parallel-width at most k, which generalizes earlier characterizations of series-parallel graphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/19/2020

On directed analogues of expander and hyperfinite graph sequences

We introduce and study analogues of expander and hyperfinite graph seque...
05/24/2022

Transition to Linearity of General Neural Networks with Directed Acyclic Graph Architecture

In this paper we show that feedforward neural networks corresponding to ...
09/04/2017

Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors

While visual comparison of directed acyclic graphs (DAGs) is commonly en...
03/19/2020

A CSP implementation of the directed bigraph embedding problem

Directed bigraphs are a meta-model which generalises Milner's bigraphs b...
06/13/2019

A complete language for faceted dataflow programs

We present a complete categorical axiomatization of a wide class of data...
09/25/2018

On Monotone Sequences of Directed Flips, Triangulations of Polyhedra, and Structural Properties of a Directed Flip Graph

In this paper, we present some rather basic and fundamental results on s...
04/21/2020

Egel – Graph Rewriting with a Twist

Egel is an untyped eager combinator toy language. Its primary purpose is...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.