Sciweavers

212 search results - page 28 / 43
» Subgraph Isomorphism in Planar Graphs and Related Problems
Sort
View
IPL
2007
101views more  IPL 2007»
14 years 9 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
DCOSS
2005
Springer
15 years 3 months ago
Infrastructure-Establishment from Scratch in Wireless Sensor Networks
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...
Stefan Funke, Nikola Milosavljevic
IWPEC
2009
Springer
15 years 4 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
ECCC
2006
70views more  ECCC 2006»
14 years 9 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
COMMA
2008
14 years 11 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter