Sciweavers

559 search results - page 61 / 112
» Augmented Marked Graphs
Sort
View
DAM
2011
13 years 3 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 9 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 3 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
COCOON
2007
Springer
14 years 3 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
13 years 11 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders