Sciweavers

760 search results - page 20 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
JDA
2010
122views more  JDA 2010»
13 years 3 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
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...
Ignasi Sau, Dimitrios M. Thilikos
APWEB
2010
Springer
13 years 12 months ago
Learning to Find Interesting Connections in Wikipedia
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 ...
Marek Ciglan, Etienne Riviere, Kjetil Nørv&...
ICIW
2009
IEEE
13 years 6 months ago
Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods
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...
Panagiotis Takis Metaxas
ISSTA
2012
ACM
11 years 11 months ago
Finding errors in multithreaded GUI applications
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...
Sai Zhang, Hao Lü, Michael D. Ernst
STOC
2004
ACM
73views Algorithms» more  STOC 2004»
14 years 9 months ago
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
Jonathan A. Kelner