796 search results - page 69 / 160 » The Anonymous Subgraph Problem |
142
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
DM
2002
15 years 2 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
116
Voted
WDAG
2010
Springer
15 years 29 days ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
130
Voted
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
145
click to vote
IPPS
2010
IEEE
15 years 15 days ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...