Sciweavers

9532 search results - page 347 / 1907
» Logic, Graphs, and Algorithms
Sort
View
213
Voted
CCS
2009
ACM
16 years 7 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
AAIM
2008
Springer
131views Algorithms» more  AAIM 2008»
16 years 1 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
Zhi-Zhong Chen, Ruka Tanahashi
CSC
2006
15 years 8 months ago
Finding Hamilton Circuit in a Graph
- The purpose of this paper is to develop an algorithm to determine the Hamilton Circuit in a given graph of degree three. This algorithm will find Hamilton Circuit in polynomial s...
Ghulam Mustafa Babar, Malik Sikander Hayat Khiyal,...
FOSSACS
1999
Springer
15 years 11 months ago
Probabilistic Temporal Logics via the Modal Mu-Calculus
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
Murali Narasimha, Rance Cleaveland, S. Purushotham...
ATAL
2010
Springer
15 years 7 months ago
Resource-bounded alternating-time temporal logic
Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools ...
Natasha Alechina, Brian Logan, Nguyen Hoang Nga, A...