At the same time, one of the most striking trends in optimization is the constantly increasing emphasis on the interdisciplinary nature of the field. Optimization has been a basic tool in all areas of applied mathematics, engineering, medicine, economics and other sciences. The series Springer ...
Graph Theory - Directed Graphs Graph Theory - Weighted Graphs Graph Theory - Bipartite Graphs Graph Theory - Complete Graphs Graph Theory - Subgraphs Graph Theory - Trees Graph Theory - Forests Graph Theory - Planar Graphs Graph Theory - Hypergraphs Graph Theory - Infinite Graphs Graph Theory - ...
Edge Cover: Set of Edges in a Graph G, such that every vertex of G is incident on atleast one of the edges in the set. ρ(G) Edge Covering number is the cardinality of minimum edge cover. Dominating Set: Set of Vertices ,such that every vertex not in Set is adjacent to at least...
We say that a graph G is a clique graph if G belongs to the image of the clique operator, i.e., if there exists a graph H such that G=K(H). Note that the number of maximal complete sets may be exponential on the number of vertices. Consider, for instance, the graph consisting ...
LetXbe an at most countable set. AgraphonXis a symmetric function\(b:X\times X\rightarrow [0,\infty )\)that vanishes on the diagonal and satisfies\(\sum _{y\in X} b(x,y)<+\infty \)for every\(x\in X\). A graph is calledconnectedif for every\(x,y\in X\)there are\(x...
Graphs on Surfaces. I. Introduction Graphs on surfaces是Topological and structural graph theory中的重要问题,其中的一些问题(比如crossing number)在incidenc…阅读全文 赞同64 21 条评论 分享收藏 一些我很喜欢的组合证明 1. Sylvester-Gallai Theorem: 上任意 个不全共线的点,至少存在一...
We solve a number of important and interesting problems from graph theory on a linear array with a reconfigurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value finding algorithms, and are currently the fastest algorithms. We also distinguish the...
In this paper, we study parameterized algorithms for a series of specific linear layout problems with respect to the vertex cover number \\(au \\) of the input graph. We first focus on the mixed s -stack q -queue layout ... Y Liu,Y Li,J Huang - Springer, Cham 被引量: 0发表: ...
& Sun, J. Enhancing crystal structure prediction by decomposition and evolution schemes based on graph theory. Fundam. Res. 1, 466–471 (2021). Article CAS Google Scholar He, L. et al. Machine-learning-driven on-demand design of phononic beams. Sci. China Phys. Mech. Astron. 2021, 65...
This study makes a novel contribution by introducing decision theory into the organisational studies and business ethics literature on participatory approaches and wicked problems. In the next section, “Conceptual Review: a Decision Theory View of Wicked Problems”, we bring both the participatory and...