270 search results - page 27 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
DAC
2000
ACM
14 years 8 months ago
2000
ACM
The proliferation of the Internet has a ected the business model of almost all semiconductor and VLSI CAD companies that rely on intellectual property (IP) as their main source of...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
SIGMOD
2010
ACM
14 years 7 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
SIGCOMM
2009
ACM
14 years 1 months ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...