760 search results - page 20 / 152 » Algorithms for finding clique-transversals of graphs |
JDA
2010
14 years 4 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
APWEB
2010
Springer
15 years 28 days ago
2010
Springer
To help users answer the question, what is the relation between (real world) entities or concepts, we might need to go well beyond the borders of traditional information retrieval ...
105
click to vote
ICIW
2009
IEEE
14 years 7 months ago
2009
IEEE
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. Bu...
109
click to vote
ISSTA
2012
ACM
13 years 1 days ago
2012
ACM
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: