万能
发表于 2025-3-21 17:34:22
书目名称Algorithms and Discrete Applied Mathematics影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0153170<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0153170<br><br> <br><br>
Feckless
发表于 2025-3-22 00:16:54
http://reply.papertrans.cn/16/1532/153170/153170_2.png
上釉彩
发表于 2025-3-22 02:26:45
Fault-Tolerant Dispersion of Mobile Robotsode anonymous graph. The goal is to ensure that regardless of the initial placement of the robots over the nodes, the final configuration consists of having at most one robot at each node. In a crash-fault setting, up to . robots may fail by crashing arbitrarily and subsequently lose all the informa
杠杆支点
发表于 2025-3-22 06:52:13
http://reply.papertrans.cn/16/1532/153170/153170_4.png
Acetaldehyde
发表于 2025-3-22 11:39:05
Algorithms for ,-Dispersion for Points in Convex Position in the Planethe objective is to compute a subset . such that . and the minimum distance between a pair of points in . is maximized. Based on the bounded search tree method, we propose an exact fixed-parameter algorithm in . time for this problem, where . is the parameter. The proposed exact algorithm improves o
esoteric
发表于 2025-3-22 13:54:17
http://reply.papertrans.cn/16/1532/153170/153170_6.png
护航舰
发表于 2025-3-22 19:23:54
http://reply.papertrans.cn/16/1532/153170/153170_7.png
Epithelium
发表于 2025-3-22 22:41:45
http://reply.papertrans.cn/16/1532/153170/153170_8.png
NIB
发表于 2025-3-23 05:27:17
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs are different. The neighbor-locating chromatic number . is the minimum . for which . admits a neighbor-locating .-coloring. A proper .-vertex-coloring of a graph . is a . . if for each pair of vertices . and . in the same color-class, there exists a color class . such that .. The locating chromatic
富饶
发表于 2025-3-23 08:49:54
http://reply.papertrans.cn/16/1532/153170/153170_10.png