Results 91 to 100 of about 2,283,531 (215)
Edge connectivity of a neutrosophic graph [PDF]
Neutosophic graphs are an extension of fuzzy and intuitionistic fuzzy graphs by including the uncertainty, vagueness, and indeterminacy that are normal in the real world.
Aparna Tripathy +3 more
doaj +1 more source
Graph Algorithms for Mixture Interpretation. [PDF]
Crysup B +3 more
europepmc +1 more source
The Current Landscape of Scalable Dynamic Graph Processing
With the rapid growth in data volume, workloads from various domains have undergone drastic changes in recent years. Today, streaming workloads are commonplace.
Gabriel G. Dos Santos +2 more
doaj +1 more source
Graph-Based Algorithms for Boolean Function Manipulation
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and
Randal Bryant (3892378)
core +1 more source
A graph rewriting programming language for graph drawing [PDF]
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Partitioning a permutation graph: algorithms and an application. [PDF]
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded size, and describe a real-life application of this problem encountered at a manufacturing company.
Moonen, Linda, Spieksma, Frederik
core
DNA Paired Fragment Assembly Using Graph Theory
DNA fragment assembly requirements have generated an important computational problem created by their structure and the volume of data. Therefore, it is important to develop algorithms able to produce high-quality information that use computer resources ...
J. Quiroz-Ibarra +2 more
core +1 more source
Degree-constrained edge partitioning in graphs arising from discrete tomography [PDF]
Starting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k=3 colors is open.
Costa, Marie-Christine +4 more
core +1 more source
The paper proposes a modification of the existing distributed forward-backward algorithm for finding strongly connected components in directed graphs. The modification aims at improving the parallelism of the algorithm by increasing the branching factor
Dominik Ryżko
doaj +1 more source
Journal of Graph Algorithms and Applications
The Journal of Graph Algorithms and Applications found at this Web site is the electronic version of the scientific journal with the same name.
core

