forager
发表于 2025-3-27 00:40:43
http://reply.papertrans.cn/39/3881/388031/388031_31.png
使成整体
发表于 2025-3-27 04:06:49
http://reply.papertrans.cn/39/3881/388031/388031_32.png
凌辱
发表于 2025-3-27 06:56:49
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
范围广
发表于 2025-3-27 11:48:59
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
发表于 2025-3-27 15:37:16
http://reply.papertrans.cn/39/3881/388031/388031_35.png
Trigger-Point
发表于 2025-3-27 17:55:10
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
发表于 2025-3-28 01:14:54
http://reply.papertrans.cn/39/3881/388031/388031_37.png
最有利
发表于 2025-3-28 05:30:10
http://reply.papertrans.cn/39/3881/388031/388031_38.png
神刊
发表于 2025-3-28 09:12:00
http://reply.papertrans.cn/39/3881/388031/388031_39.png
Antigen
发表于 2025-3-28 10:27:39
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