tf = ismultigraph(G) returns logical 1 (true) if G has multiple edges between any two nodes. Otherwise, it returns logical 0 (false). By convention, ismultigraph returns logical 0 (false) for graphs that contain self-loops, but no repeated edges. However, a graph with multiple self-loop...
Let $G$ be a connected planar (but not yet embedded) graph and $F$ a set of additional edges not yet in $G$. The {multiple edge insertion} problem (MEI) asks for a drawing of $G+F$ with the minimum number of pairwise edge crossings, such that the subdrawing of $G$ is plane...
The multiple tree is a multiple graph with no multiple cycles. The number of edges may be different for multiple trees with the same number of vertices. We prove lower and upper bounds on the number of edges in an arbitrary multiple tree. Also we consider spanning trees of an arbitrary ...
Computationally, each map implies a 'partial' scaffold ordering, which can be modeled as a directed acyclic graph (DAG), with edges representing the relative order between scaffolds. In the absence of conflict, the order of physical scaffolds can be solved by merging multiple DAGs followed by a...
2699.Modify-Graph-Edge-Weights (H) 3112.Minimum-Time-to-Visit-Disappearing-Nodes (M) 3123.Find-Edges-in-Shortest-Paths (H-) Floyd 1334.Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance (M) 2642.Design-Graph-With-Shortest-Path-Calculator (M+) 2959.Number-of-Pos...
The poor prognosis of head and neck cancer (HNC) is associated with metastasis within the lymph nodes (LNs). Herein, the proteome of 140 multisite samples from a 59-HNC patient cohort, including primary and matched LN-negative or -positive tissues, saliva, and blood cells, reveals insights ...
Let us first give some preliminaries on graph theory. The communication topology among agents is described by a directed graph G≜(V,E), with V≜{0,1,…,N} the set of nodes (agents) and with E⊆V×V the set of directed edges between two distinct agents. A directed edge (j,i...
Red-Black Graph - A DAG of Multiple, Interleaved Binary Trees Introduction Red-Black Graphs are a specific type of graph, a directed acyclic graph of interleaved binary trees. This data structure resulted from exploration of efficient representations for family history. This package presents and impl...
On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs There are numerous examples of the so-called square root phenomenon in the field of parameterized algorithms: many of the most fundamental graph problems, ... D Marx,M Pilipczuk,M Pilipczuk 被引...
Consider a sensor network whose topology is represented by a directed graph G=(V,E,A) of order n with the set of nodes (sensors) V={1,2,…,n}, set of edges E⊆V×V, and a weighted adjacency matrix A=[aij] with nonnegative adjacency elements aij. An edge of G is denoted by...