Titlebook: ;

breadth

Priapism

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

NOMAD

熱心助人

輕快帶來(lái)危險(xiǎn)

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

忘恩負(fù)義的人

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

拾落穗

NLC-2 Graph Recognition and Isomorphism,structural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm [14]. 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

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

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