Titlebook: ;

forager

使成整体

凌辱

Lexicographic Breadth First Search – A Surveygorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new directions for further research in the area of graph searching

范围广

Wireless Networking: Graph Theory Unpluggedeory problems. In particular the rapidly growing areas of ad-hoc and sensor networks demand new solutions for timeless graph theory problems, because i) wireless devices have lower bandwidth and ii) wireless devices are mobile and therefore the topology of the network changes rather frequently. As a

AGGER

Trigger-Point

Treelike Comparability Graphs: Characterization, Recognition, and Applications treelike comparability graphs are distance hereditary. Utilizing this property, we give a linear time recognition algorithm. We then characterize permutation graphs that are treelike. Finally, we consider the . problem on special subgraphs of treelike permutation graphs.

Initial

最有利

神刊

Antigen

Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs, the algorithm supports arc and vertex modification (insertion or deletion) in . time where . is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular tree decomposition is updated; otherwise, a certificate is returned within the same