5889 search results - page 387 / 1178 » Graph Layout Problems |
147
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
166
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
181
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
167
click to vote
ISCAS
2005
IEEE
16 years 12 days ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
180
click to vote
ICALP
2004
Springer
16 years 6 days ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...