Sciweavers

28 search results - page 4 / 6
» dam 2002
Sort
View
DAM
2002
91views more  DAM 2002»
13 years 5 months ago
NeST graphs
We establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeS...
Ryan B. Hayward, Paul E. Kearney, Andrew J. Malton
DAM
2002
76views more  DAM 2002»
13 years 5 months ago
Edge-pancyclicity of coupled graphs
The coupled graph c(G) of a plane graph G is the graph de
Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhan...
DAM
2007
63views more  DAM 2007»
13 years 5 months ago
Attacking a public key cryptosystem based on tree replacement
We point out several security flaws in the cryptosystem based on tree replacement systems proposed by Samuel, Thomas, Abisha and Subramanian at INDOCRYPT 2002. Due to the success...
Maria Isabel Gonzalez Vasco, David Pérez-Ga...
DAM
2002
120views more  DAM 2002»
13 years 5 months ago
Connectivity and fault-tolerance of hyperdigraphs
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
Daniela Ferrero, Carles Padró
DAM
2002
82views more  DAM 2002»
13 years 5 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian