1162 search results - page 16 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
169
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
155
Voted
ALGORITHMICA
2008
15 years 3 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
126
Voted
SEFM
2008
IEEE
15 years 10 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
143
Voted
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
155
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...