1736 search results - page 5 / 348 » On antimagic directed graphs |
141
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
145
Voted
GBRPR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
129
Voted
WG
2007
Springer
15 years 11 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...