91 search results - page 7 / 19 » Routing Flow Through a Strongly Connected Graph |
ECCC
2007
13 years 7 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
SPAA
2003
ACM
14 years 22 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
PACT
2005
Springer
14 years 1 months ago
2005
Springer
We describe a fragment of the hardware description language VHDL that is suitable for implementing the Advanced Encryption Standard algorithm. We then define an Information Flow a...
CODES
2007
IEEE
14 years 1 months ago
2007
IEEE
In current Field-Programmable-Logic Architecture (FPGA) design flows, it is very hard to control the routing of submodules. It is thus very hard to make an identical copy of an ex...