breadth
发表于 2025-3-23 13:05:28
http://reply.papertrans.cn/39/3881/388026/388026_11.png
Priapism
发表于 2025-3-23 15:01:55
Graph Searching in a Crime Wave,r model is defined for robbers that are visible (the cops know their position) and active (able to move at every turn) but is easily adapted to other common variants of the game. The game with many robbers is non-monotone: more cops are needed if their moves are restricted so as to monotonically dec
SLAG
发表于 2025-3-23 20:29:17
http://reply.papertrans.cn/39/3881/388026/388026_13.png
NOMAD
发表于 2025-3-24 00:38:23
http://reply.papertrans.cn/39/3881/388026/388026_14.png
热心助人
发表于 2025-3-24 04:33:18
http://reply.papertrans.cn/39/3881/388026/388026_15.png
轻快带来危险
发表于 2025-3-24 07:51:53
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions,hs over .(2). We propose here algebraic operations on graphs that characterize rank-width. For algorithmic purposes, it is important to represent graphs by balanced terms. We give a unique theorem that generalizes several “balancing theorems” for tree-width and clique-width. New results are obtained
忘恩负义的人
发表于 2025-3-24 12:06:15
The Clique-Width of Tree-Power and Leaf-Power Graphs,(1.) the .-power graph of a tree has NLC-width at most . + 2 and clique-width at most ., (2.) the .-leaf-power graph of a tree has NLC-width at most . and clique-width at most ., and (3.) the .-power graph of a graph of tree-width . has NLC-width at most (. + 1).− 1 and clique-width at most 2·(. + 1
拾落穗
发表于 2025-3-24 18:36:40
NLC-2 Graph Recognition and Isomorphism,structural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm . Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust .(...)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is
travail
发表于 2025-3-24 19:38:13
A Characterisation of the Minimal Triangulations of Permutation Graphs,., graphs that are both comparability and cocomparability graphs, it is known that minimal triangulations are interval graphs. We (negatively) answer the question whether every interval graph is a minimal triangulation of a permutation graph. We give a non-trivial characterisation of the class of in
Encapsulate
发表于 2025-3-25 00:25:23
The 3-Steiner Root Problem,ge set where ..(.,.) is the distance between . and . in graph .. The . on a graph . asks for a tree . with .(.) ⊆ .(.) and . is the subgraph of .. induced by .(.). If such a tree . exists, we call it a . of .. This paper gives a linear time algorithm for the 3-Steiner root problem. Consider an unroo