Results 231 to 240 of about 2,474,612 (263)

Strict optimal rubbling of graphs

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

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   +2 more sources

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   +2 more sources

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

Uniformly optimally reliable graphs

Networks, 1998
Summary: A graph with \(n\) nodes and \(e\) edges, where the nodes are perfectly reliable and the edges fail independently with equal probability \(p\), is said to be Uniformly Optimally Reliable (UOR) if it has the greatest reliability among all graphs with the same number of nodes and edges for all values of \(p\).
Daniel Gross, John T. Saccoman
openaire   +3 more sources

Graph Classification Based on Optimizing Graph Spectra

2010
Kernel methods such as the SVM are becoming increasingly popular due to their high performance in graph classification. In this paper, we propose a novel graph kernel, called SPEC, based on graph spectra and the Interlace Theorem, as well as an algorithm, called OPTSPEC, to optimize the SPEC kernel used in an SVM for graph classification.
Nguyen Duy Vinh, Akihiro Inokuchi, Takashi Washio   +2 more
openaire   +2 more sources

Optimal constrained graph exploration

ACM Transactions on Algorithms, 2006
We address the problem of constrained exploration of an unknown graph G = ( V , E ) from a given start node s with either a tethered robot or a robot with a fuel tank of limited capacity, the former being a tighter constraint. In both variations
Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar 0001   +2 more
openaire   +2 more sources

Graphs and Optimization

2016
The matching problem is an important combinatorial problem defined on a graph. Graphs provide very often a pictorial representation of the mathematical structure underlying combinatorial optimization problems. On the other hand, graph theory is by itself rich of elegant results that can give us useful insights on many combinatorial and physical ...
openaire   +1 more source

Modified Graph Systems for Distributed Optimization

Science China Information Sciences, 2023
Dongyun Wang, Zicong Xia
exaly  

On Optimal Ear-Decompositions of Graphs

1999
This paper can be considered as a continuation of a paper [7] of the author. We consider optimal ear-decompositions of graphs that contain even ears as few as possible. The ear matroid of a graph was introduced in [7] via optimal ear-decompositions. Here we give a simple description of the blocks of the ear matroid of a graph.
openaire   +2 more sources