1105 search results - page 132 / 221 » Linear choosability of graphs |
112
click to vote
SIROCCO
2003
15 years 6 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
131
Voted
GD
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
117
click to vote
ARSCOM
2007
15 years 4 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
117
click to vote
FMSD
2007
15 years 4 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
127
Voted
ECCC
1998
15 years 4 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...