Results 251 to 260 of about 714,042 (275)
Some of the next articles are maybe not open access.
Graph Classification Based on Optimizing Graph Spectra
2010Kernel 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 +2 more
openaire +1 more source
Graphing an Optimal Grand Strategy
Military Operations Research, 1995Graph theory provides a useful framework for generating insights into problems of sufficiency and optimality across a wide variety of physical relationships. Applied to the realm of grand strategy, this approach assists in developing a methodology for estimating the minimum level of forces required and determining the optimal deployments for the ...
Arquilla, John, Fredricksen, Hal
openaire +2 more sources
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
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, 2023Zicong Xia, Dongyun Wang
exaly
On Optimal Ear-Decompositions of Graphs
1999This 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 +1 more source
Applying graph-based differential grouping for multiobjective large-scale optimization
Swarm and Evolutionary Computation, 2020Bin Cao, Jianwei Zhao, Yu Gu
exaly
GON: End-to-end optimization framework for constraint graph optimization problems
Knowledge-Based Systems, 2022Chuan Liu, Jingwei Wang, Yunkang Cao
exaly
Graph Optimization Approach to Range-Based Localization
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2021Xu Fang, Chen Wang, Thien-Minh Nguyen
exaly
Graph Transform Optimization With Application to Image Compression
IEEE Transactions on Image Processing, 2020Giulia Fracastoro +2 more
exaly

