1101 search results - page 65 / 221 » An Algorithm for the Graph Crossing Number Problem |
135
click to vote
ECCC
2010
14 years 12 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
130
Voted
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
130
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
113
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
128
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...