2398 search results - page 65 / 480 » Constraint Programming and Graph Algorithms |
155
click to vote
HIPC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
134
click to vote
DAC
1999
ACM
16 years 5 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
169
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
150
Voted
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
130
Voted
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...