1952 search results - page 89 / 391 » Complete partitions of graphs |
118
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
135
click to vote
CHARME
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
146
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
184
Voted
WG
2010
Springer
15 years 2 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
117
click to vote
TPDS
1998
15 years 3 months ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...