Results 11 to 20 of about 1,724,695 (249)
The Existence of Planar Hypotraceable Oriented Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A digraph is \emph{traceable} if it has a path that visits every vertex. A digraph $D$ is \emph{hypotraceable} if $D$ is not traceable but $D-v$ is traceable for every vertex $v\in V(D)$.
Susan van Aardt +2 more
doaj +1 more source
Oriented Flip Graphs and Noncrossing Tree Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions.
Alexander Garver, Thomas McConville
doaj +1 more source
The Java system dependence graph [PDF]
, 2003 The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984 [14]. It was suggested to be a suitable internal program representation for monolithic programs, for the purpose of carrying out certain software engineering operations such
Walkinshaw, N., Roper, M., Wood, M.
core +4 more sources
The Oriented and Flux-Weighted Current Density Stagnation Graph of LiH [PDF]
, 2022 A scheme is introduced to quantitatively analyze the magnetically induced molecular current density vector field J. After determining the set of zero points of J, which is called its stagnation graph (SG), the line integrals -1/mu_0 \int_li B.dl along ...
Raphael J F, Berger, Maria, Dimitrova
core +1 more source
Strong oriented chromatic number of planar graphs without short cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping φ from V(G) to M such that (1) φ(u) ≠ φ(v) whenever uv is an arc in G and (2) φ(v) - φ(u) ≠ -(φ(t) - φ(z)) whenever uv and zt are two arcs in
Mickaël Montassier +2 more
doaj +2 more sources
List-antimagic labeling of vertex-weighted graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Zhanar Berikkyzy +4 more
doaj +1 more source
New skew equienergetic oriented graphs [PDF]
Communications in Combinatorics and Optimization, 2019 Let $S(G^{\sigma})$ be the skew-adjacency matrix of the oriented graph $G^{\sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $\sigma$ to each of its edges.
X. Liu, L. Wang, C. Duan
doaj +1 more source
A review on graph representation for object-oriented programming [PDF]
BIO Web of ConferencesRelationships and connections between entities are typically represented by graphs, a fundamental data structure in computer science. A graph illustrates the control flow among statements within a program, whereas a dependence graph delineates the ...
Farooq Khattak Umar +2 more
doaj +1 more source
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
Minimizing the oriented diameter of a planar graph [PDF]
, 2009 We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Noble, SD +3 more
core +1 more source