686 search results - page 121 / 138 » Packing Cycles in Graphs |
136
Voted
OOPSLA
2010
Springer
15 years 2 months ago
2010
Springer
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
127
Voted
JCSS
2011
14 years 10 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
145
click to vote
TALG
2011
14 years 10 months ago
2011
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
152
click to vote
SODA
2010
ACM
16 years 29 days ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
134
Voted
ICCAD
2006
IEEE
16 years 14 days ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...