820 search results - page 12 / 164 » Inducing Temporal Graphs |
84
Voted
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—The development and deployment of distributed network-aware applications and services require the ability to compile and maintain a model of the underlying network resources wit...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
DM
2010
14 years 11 months ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
93
Voted
WG
2010
Springer
14 years 9 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
SIAMDM
2008
14 years 11 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...