laceration
发表于 2025-3-30 10:25:35
https://doi.org/10.1007/978-3-0348-7175-4icular, when a problem is already known to be polynomially solvable for some class of inputs, then it is natural to parameterize by the distance of a general instance to a tractable class. In the context of graph algorithms, parameters like vertex cover, twin cover, treewidth and treedepth modulator
尖牙
发表于 2025-3-30 13:02:11
Der Quotienten-Differenzen-Algorithmusrphism . of an (., .)-colored mixed graph . to an (., .)-colored mixed graph . is a vertex mapping such that if . is an arc (edge) of color . in ., then .(.).(.) is an arc (edge) of color . in .. The .. . of an (., .)-colored mixed graph . is the order (number of vertices) of a smallest homomorphic
GNAW
发表于 2025-3-30 19:15:39
http://reply.papertrans.cn/16/1532/153169/153169_53.png
Epidural-Space
发表于 2025-3-30 22:48:35
Der Radio-Amateur (Radio-Telephonie)r a semi-complete multigraph, that is a multigraph with at least one edge between each pair of vertices, to have a .-decomposition. We show that this condition can be tested in strongly polynomial-time, and that the same condition applies to a larger class of multigraphs. We give a similar condition
骑师
发表于 2025-3-31 03:17:00
http://reply.papertrans.cn/16/1532/153169/153169_55.png
Amylase
发表于 2025-3-31 06:24:38
https://doi.org/10.1007/978-3-662-37020-9of . if there exists an . such that . for every .. In this paper we study .-distance magic labeling of the graph . for .. We obtain .-distance magic labelings of . with respect to certain classes of abelian groups. We also obtain necessary conditions for existence of such labelings.
Criteria
发表于 2025-3-31 10:45:32
http://reply.papertrans.cn/16/1532/153169/153169_57.png
辩论的终结
发表于 2025-3-31 13:42:49
http://reply.papertrans.cn/16/1532/153169/153169_58.png
油毡
发表于 2025-3-31 17:59:57
http://reply.papertrans.cn/16/1532/153169/153169_59.png
Osteoarthritis
发表于 2025-3-31 21:46:38
http://reply.papertrans.cn/16/1532/153169/153169_60.png