Results 281 to 290 of about 206,716 (316)
Some of the next articles are maybe not open access.
Constraint programming and graph algorithms
Annals of Mathematics and Artificial Intelligence, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Gangnet, Burton Rosenberg
openaire +2 more sources
Inductive graphs and functional graph algorithms
Journal of Functional Programming, 2001We propose a new style of writing graph algorithms in functional languages which is based on an alternative view of graphs as inductively defined data types. We show how this graph model can be implemented efficiently, and then we demonstrate how graph algorithms can be succinctly given by recursive function definitions based on the inductive graph ...
openaire +1 more source
Graph Subcolorings: Complexity and Algorithms
SIAM Journal on Discrete Mathematics, 2003Summary: In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint union of complete graphs. \textit{P. Erdős} [Mat. Lapok 18, 283-288 (1967; Zbl 0193.24302)] and, independently, \textit{M. O. Albertson} et al. [Discrete Math.
Jirí Fiala 0001 +3 more
openaire +2 more sources
Genetic algorithm and graph partitioning
IEEE Transactions on Computers, 1996Summary: Hybrid genetic algorithms (GAs) for the graph partitioning problem are described. The algorithms include a fast local improvement heuristic. One of the novel features of these algorithms is the schema preprocessing phase that improves GAs' space searching capability, which in turn improves the performance of GAs.
Thang Nguyen Bui, Byung Ro Moon
openaire +2 more sources
2000
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive. Thus, it is desirable to reuse such implementations whenever possible. The implementations ofgraph algorithms normally cannot be reused mainly because the representations ofgraphs differ in many ways and the implementations normally assume one specific ...
openaire +1 more source
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive. Thus, it is desirable to reuse such implementations whenever possible. The implementations ofgraph algorithms normally cannot be reused mainly because the representations ofgraphs differ in many ways and the implementations normally assume one specific ...
openaire +1 more source
IEEE Transactions on Systems, Man, and Cybernetics, 1980
Ghahraman, David E. +2 more
openaire +2 more sources
Ghahraman, David E. +2 more
openaire +2 more sources
Computing Graph Neural Networks: A Survey from Algorithms to Accelerators
ACM Computing Surveys, 2022Sergi Abadal +2 more
exaly
Graph Algorithms with Partition Transparency
IEEE Transactions on Knowledge and Data Engineering, 2021Wenfei Fan, Qiang Yin, Ping Lu
exaly