Results 51 to 60 of about 137 (126)
Discrete Realizations of Contact and Intersection Graphs (Extended Abstract)
, 1998 Known realizations of geometric representations of graphs, like contact, intersection etc., are "continuous", in the sense that the geometric objects are drawn in Euclidean space with real numbers as coordinates.
Urrutia, Jorge +3 more
core +1 more source
Using Decoupled Features for Photorealistic Style Transfer
, 2023 45 pags., 23 figs., 8 algorithms, 1 tab. -- AMS subject classifications. 68Q25, 68R10, 68U05In this work we propose a photo-realistic style transfer method for image and video that is based on vision science principles and on a recent mathematical ...
Javier Portilla +7 more
core +1 more source
Comparison of open-source software for producing directed acyclic graphs
Journal of Causal InferenceMany software packages have been developed to assist researchers in drawing directed acyclic graphs (DAGs), each with unique functionality and usability. We examine five of the most common software to generate DAGs: TikZ, DAGitty, ggdag, dagR, and igraph.
Pitts Amy J., Fowler Charlotte R.
doaj +1 more source
The agreement distance of unrooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj +1 more source
Algorithmic aspects of bipartite graphs
International Journal of Mathematics and Mathematical Sciences, Volume 18, Issue 2, Page 299-304, 1995., 1995 We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill‐in of a given ordered graph.
Mihály Bakonyi, Erik M. Varness
wiley +1 more source
Path-induced closure operators on graphs for defining digital Jordan surfaces
Open Mathematics, 2019 Given a simple graph with the vertex set X, we discuss a closure operator on X induced by a set of paths with identical lengths in the graph. We introduce a certain set of paths of the same length in the 2-adjacency graph on the digital line ℤ and ...
Šlapal Josef
doaj +1 more source
A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S. +2 more
doaj +1 more source
Decomposition of the Product of Cycles Based on Degree Partition
Discussiones Mathematicae Graph Theory, 2019 The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source
A Note on Graph Burning of Path Forests [PDF]
Discrete Mathematics & Theoretical Computer ScienceGraph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the burning number conjecture, which says that every connected graph of order $
Ta Sheng Tan, Wen Chean Teh
doaj +1 more source
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs.
Fernando Esteban Contreras-Mendoza +1 more
doaj +1 more source