1027 search results - page 36 / 206 » Ordered Vertex Partitioning |
150
click to vote
TOPNOC
2010
14 years 10 months ago
2010
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
107
click to vote
ALT
2009
Springer
16 years 9 days ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
106
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
116
click to vote
HPCC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
144
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...