796 search results - page 28 / 160 » The Anonymous Subgraph Problem |
WALCOM
2008
IEEE
13 years 10 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
ORL
2010
13 years 7 months ago
2010
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these ...
FC
2010
Springer
13 years 9 months ago
2010
Springer
The Tor network is one of the largest deployed anonymity networks, consisting of 1500+ volunteer-run relays and probably hundreds of thousands of clients connecting every day. Its ...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— Many topology discovery systems rely on traceroute to discover path information in public networks. However, for some routers, traceroute detects their existence but not their ...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...