Results 241 to 250 of about 714,042 (275)

Graph signatures: Identification and optimization

European Journal of Operational Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balabhaskar Balasundaram, Juan Sebastian Borrero, Hao Pan   +2 more
openaire   +2 more sources

The Optimal Partitioning of Graphs

SIAM Journal on Applied Mathematics, 1976
The problem considered in this paper is that of partitioning a link-weighted graph G into two parts, each of which is constrained in size by the (given) maximum number of vertices that the part can contain. This is a special case of the general partitioning problem of a graph into k parts with size constraints, which appears in a number of very diverse
Christofides, Nicos, Brooker, P.
openaire   +1 more source

Optimal Rearrangeable Graphs

Bell System Technical Journal, 1975
Many important properties of switching networks can be effectively studied in the more general context of graph theory. In particular, the various rearrangeability properties of a network fall into this category. If G is a graph with vertex set V = I ∪ Ω, we say G is rearrangeable if, for all choices of distinct vertices, i 1 , i 2 , …, i 1 in I and j
openaire   +2 more sources

Random Graphs and Graph Optimization Problems

SIAM Journal on Computing, 1980
One major difficulty in analyzing algorithms for graph optimization problems is that the probabilistic behavior of the optimum solutions to most of the important problems is generally unknown. We present a general method for relating some well-known results regarding the probability of existence of certain subgraphs in random graphs to the ...
openaire   +2 more sources

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, Andrew K. C. Wong, Tung Au   +2 more
openaire   +1 more source

Optimal 1-hamiltonian graphs

Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu   +2 more
openaire   +1 more source

Optimal Mixed Graph Augmentation

SIAM Journal on Computing, 1987
We consider an augmentation problem on mixed graphs that generalizes and unifies two augmentation problems considered by \textit{K. P. Eswaran} and \textit{R. E. Tarjan} [ibid. 5, 653-665 (1976; Zbl 0346.05112)]. The mixed augmentation problem has applications in the design of communication networks, and forms of mixed augmentation problem are central ...
openaire   +1 more source

Optimal Graph Search with Iterated Graph Cuts

Proceedings of the AAAI Conference on Artificial Intelligence, 2011
Informed search algorithms such as A* use heuristics to focus exploration on states with low total path cost. To the extent that heuristics underestimate forward costs, a wider cost radius of suboptimal states will be explored. For many weighted graphs, however, a small distance in terms of cost may encompass a large fraction of the ...
David Burkett, David Hall 0006, Dan Klein 0001   +2 more
openaire   +1 more source

Strict optimal rubbling of graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Optimization of hierarchical directed graphs

Computer Languages, 1981
A machine- and language-independent representation for programs suitable for use within a compiler is presented. This representation is the hierarchical directed graph. Powerful code optimization techniques are presented in the context of this representation. An experimental optimizer has been built to validate the ideas discussed.
M. T. Lepage, David T. Barnard, Andres Rudmik   +2 more
openaire   +1 more source