Sciweavers

1736 search results - page 41 / 348
» On antimagic directed graphs
Sort
View
ERLANG
2004
ACM
14 years 1 months ago
Flow graphs for testing sequential Erlang programs
Testing of software components during development is a heavily used approach to detect programming errors and to evaluate the quality of software. Systematic approaches to softwar...
Manfred Widera
DM
2006
121views more  DM 2006»
13 years 7 months ago
The acircuitic directed star arboricity of subcubic graphs is at most four
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
Alexandre Pinlou, Eric Sopena
STACS
2010
Springer
14 years 2 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
CCCG
2009
13 years 8 months ago
On Directed Graphs with an Upward Straight-line
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
IPL
2007
74views more  IPL 2007»
13 years 7 months ago
Minimum cycle bases of direct products of complete graphs
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...
Richard Hammack