Results 181 to 190 of about 2,283,531 (215)
Some of the next articles are maybe not open access.

Approximation algorithms for graph augmentation

Journal of Algorithms, 1992
Summary: The problem of increasing both edge and vertex connectivity of a graph at an optimal cost is studied. Since the general problem is NP-hard, we focus on efficient approximation schemes that come within a constant factor from the optimal. Previous algorithms either do not take edge costs into consideration, or they run slower than our algorithm.
Samir Khuller, Ramakrishna Thurimella
openaire   +3 more sources

Inductive graphs and functional graph algorithms

Journal of Functional Programming, 2001
We 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 Optimal Monomorphism Algorithms

IEEE Transactions on Systems, Man, and Cybernetics, 1980
The characterization of graph morphisms in terms of the subgraphs of the Cartesian graph product is extended and used to develop algorithms for an optimal graph monomorphism problem. The objective functional considered is defined as the sum of the weights associated with vertex and arc mappings.
David Ghahraman   +2 more
openaire   +2 more sources

Graph bisection algorithms.

1986
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986. ; MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. ; Bibliography: leaves 64-66. ; by Thang Nguyen Bui. ; Ph.D.
openaire   +1 more source

Deduction graphs: an algorithm and applications

IEEE Transactions on Software Engineering, 1989
A deduction graph (DG) for logically deducing a new functional dependency (FD) or function-free Horn formula (extended from Horn clauses) from a subset of given FD's or function-free headed Horn clauses in a relational database or rule-based expert system is defined. An algorithm with a polynomial time complexity for constructing a DG based on a number
openaire   +3 more sources

Graph Monomorphism Algorithms

IEEE Transactions on Systems, Man, and Cybernetics, 1980
Ghahraman, David E.   +2 more
openaire   +2 more sources

Computing Graph Neural Networks: A Survey From Algorithms to Accelerators

ACM Computing Surveys, 2022
Eduard Alarcón   +2 more
exaly  

GRAPH CONNECTIVITY ALGORITHM

Annals of the New York Academy of Sciences, 1970
openaire   +1 more source

Dynamic Graph Algorithms

2013
DEMETRESCU, Camil   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy