1736 search results - page 146 / 348 » On antimagic directed graphs |
158
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
178
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
160
click to vote
CN
1999
15 years 6 months ago
1999
From a user's perspective, hypertext links on the web form a directed graph between distinct information sources. We investigate the effects of discovering "backlinks&qu...
172
click to vote
IPMU
2010
Springer
15 years 4 months ago
2010
Springer
We overview three kinds of possibilistic graphical models (based on directed acyclic graphs) and present, how they can be expressed by means of non-graphical approach to multidimen...
176
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...