Organonitrile
发表于 2025-3-25 06:49:42
http://reply.papertrans.cn/39/3881/388021/388021_21.png
预感
发表于 2025-3-25 07:39:57
Moderne Mehrgitter-Elektronenröhrent is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and in . time for chordal graphs.
lambaste
发表于 2025-3-25 12:13:51
http://reply.papertrans.cn/39/3881/388021/388021_23.png
Ischemic-Stroke
发表于 2025-3-25 15:53:27
https://doi.org/10.1007/978-3-642-50742-7 at least . vertices. This graph invariant, which can be seen as a generalization of a minimum edge-cut, has been extensively studied from a combinatorial point of view. However, very little is known about the complexity of computing .. Very recently, in the parameterized complexity community the no
相信
发表于 2025-3-25 22:19:41
http://reply.papertrans.cn/39/3881/388021/388021_25.png
Palliation
发表于 2025-3-26 01:46:28
http://reply.papertrans.cn/39/3881/388021/388021_26.png
欢呼
发表于 2025-3-26 04:44:53
http://reply.papertrans.cn/39/3881/388021/388021_27.png
COWER
发表于 2025-3-26 11:37:03
The Stable Fixtures Problem with Paymentsity function . and an edge weighting .. The set . consists of a number of players that are to form a set . of 2-player coalitions . with value .(.), such that each player . is in at most .(.) coalitions. A payoff is a mapping . with . if . and . if .. The pair (., .) is called a solution. A pair of
insular
发表于 2025-3-26 14:42:59
Complexity of Secure Setsown that deciding whether a set . is secure in a graph is .-complete. However, it is still open how this result contributes to the actual complexity of deciding whether, for a given graph . and integer ., a non-empty secure set for . of size at most . exists. While membership in the class . is rathe
sed-rate
发表于 2025-3-26 17:56:54
http://reply.papertrans.cn/39/3881/388021/388021_30.png