撕裂皮肉
发表于 2025-3-23 10:21:52
http://reply.papertrans.cn/39/3881/388036/388036_11.png
Ancillary
发表于 2025-3-23 15:41:00
http://reply.papertrans.cn/39/3881/388036/388036_12.png
Fracture
发表于 2025-3-23 20:12:12
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs,t in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). Furthermore, we show that Ω(1.3247.) is a lower bound on the worst-case running time of this algorithm.
臭名昭著
发表于 2025-3-23 23:07:48
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time,parability graph using .(.) integers so that, given two vertices, it can be determined in .(1) time whether they are adjacent, no matter how dense the graph is. We give a linear-time algorithm for finding the four linear orders, improving on their bound of .(. .).
诱导
发表于 2025-3-24 05:53:51
https://doi.org/10.1007/978-1-4615-1203-5t in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). Furthermore, we show that Ω(1.3247.) is a lower bound on the worst-case running time of this algorithm.
老人病学
发表于 2025-3-24 08:06:11
http://reply.papertrans.cn/39/3881/388036/388036_16.png
aquatic
发表于 2025-3-24 11:23:50
http://reply.papertrans.cn/39/3881/388036/388036_17.png
Callus
发表于 2025-3-24 18:08:34
Generalised Dualities and Finite Maximal Antichains,existence of homomorphism. We show that these antichains correspond exactly to the generalised dualities. This solves a problem posed in . Finally, we show that it is NP-hard to decide whether a finite set of digraphs forms a maximal antichain.
粘连
发表于 2025-3-24 20:38:24
http://reply.papertrans.cn/39/3881/388036/388036_19.png
Torrid
发表于 2025-3-25 03:05:02
Generalised Dualities and Finite Maximal Antichains,termined by a finite number of forbidden subgraphs. We prove that these situations, called ., are characterised by the non-existence of a homomorphism to . from a finite set of forests..Furthermore, we characterise all finite maximal antichains in the partial order of directed graphs ordered by the