3268 search results - page 105 / 654 » The hub number of a graph |
164
click to vote
DM
1999
15 years 6 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
157
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
145
click to vote
ICDCIT
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
135
click to vote
COCOON
2009
Springer
16 years 29 days ago
2009
Springer
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
177
click to vote
WPES
2006
ACM
16 years 10 days ago
2006
ACM
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...