715 search results - page 71 / 143 » On graphs with subgraphs having large independence numbers |
101
click to vote
MST
2010
14 years 6 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...
101
click to vote
ACSD
2005
IEEE
15 years 5 months ago
2005
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
124
click to vote
ACSAC
2006
IEEE
15 years 6 months ago
2006
IEEE
The efficiency of promptly releasing security alerts of established analysis centers has been greatly challenged by the continuous emergence of various large scale network attack...
104
click to vote
ISPASS
2009
IEEE
15 years 6 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...