1736 search results - page 213 / 348 » On antimagic directed graphs |
227
click to vote
ECCC
2007
15 years 6 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
174
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
160
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Abstract. In the context of an approach for reengineering legacy software systems at the architectural level, we present in this paper a reverse engineering methodology that uses a...
199
click to vote
IJSI
2008
15 years 6 months ago
2008
In this paper, we demonstrate the use of qualitative spatial modelling as the foundation for the conceptual representation of route instructions, to enable robust humanrobot intera...
189
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...