2612 search results - page 74 / 523 » Switching Graphs and Their Complexity |
ANCS
2008
ACM
14 years 8 hour ago
2008
ACM
We describe the implementation of an OpenFlow Switch on the NetFPGA platform. OpenFlow is a way to deploy experimental or new protocols in networks that carry production traffic. ...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
COMGEO
2010
ACM
13 years 10 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
AICCSA
2005
IEEE
14 years 3 months ago
2005
IEEE
Multicast communication, which involves transmitting information from one node to multiple nodes, is a vital operation in both broadband integrated services digital networks (BISD...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...