3757 search results - page 297 / 752 » The overlap number of a graph |
131
Voted
GD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
139
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
182
click to vote
ISCC
1999
IEEE
15 years 11 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
162
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. To impro...
172
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...