本义
发表于 2025-3-21 17:03:17
书目名称Computer Science – Theory and Applications影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0233818<br><br> <br><br>书目名称Computer Science – Theory and Applications读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0233818<br><br> <br><br>
Ophthalmoscope
发表于 2025-3-21 22:29:47
,Coloring a Dominating Set Without Conflicts: ,-Subset Square Coloring,olors. In this paper, we initiate the study of a related coloring problem called the . of graphs. Broadly, the subset square coloring of a graph studies the square coloring of a dominating set of a graph using . colors. Here the aim is to optimize the number of colors used. This also generalizes the
Obvious
发表于 2025-3-22 04:27:59
,Parameterized Complexity of List Coloring and Max Coloring,each ., . and for each edge ., .. Fiala et al. (TCS 2011) proved that . is W-hard when parameterized by the vertex cover number of the input graph. Recently, Gutin et al. (STACS 2020, SIDMA 2021) designed an . time randomized algorithm for . where . is the size of the given clique modulator of th
繁忙
发表于 2025-3-22 07:57:05
,Eternal Vertex Cover on Bipartite Graphs,very move, one player (the attacker) attacks an edge. In response to the attack, the second player (the defender) moves some of the guards along the edges of the graph in such a manner that at least one guard moves along the attacked edge. If such a movement is not possible, then the attacker wins.
跑过
发表于 2025-3-22 10:14:55
http://reply.papertrans.cn/24/2339/233818/233818_5.png
有毒
发表于 2025-3-22 15:36:55
http://reply.papertrans.cn/24/2339/233818/233818_6.png
有毒
发表于 2025-3-22 21:00:45
Output Sensitive Fault Tolerant Maximum Matching,f a maximum matching of .. A subgraph . of . is an . . . if it has the following property: For any set . of at most . vertices or edges in ., .. Assadi and Bernstein showed that for any ., there exists a .-FTMS of size .. In this paper we initiate a study of (1, .)-FTMS or .-FTMS in shor
序曲
发表于 2025-3-22 21:39:47
,Bounds for Synchronizing Markov Decision Processes,get states, either once, always, infinitely often, or always from some point on, where . for sure synchronizing, and . for almost-sure and limit-sure synchronizing..We introduce two new qualitative modes of synchronizing, where the probability mass should be either ., or . away from 0. They can be v
Accolade
发表于 2025-3-23 02:20:46
http://reply.papertrans.cn/24/2339/233818/233818_9.png
aerial
发表于 2025-3-23 06:02:33
http://reply.papertrans.cn/24/2339/233818/233818_10.png