Fixed-parameter tractability results for full-degree spanning tree and its dual.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 116, doi. 10.1002/net.20353
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2010 AND VI 56 AND IP 2
Results: 8
1
2
The diameter and connectivity of networks with random dependent faults.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 103, doi. 10.1002/net.20352
- By:
- Publication type:
- Article
3
Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 149, doi. 10.1002/net.20356
- By:
- Publication type:
- Article
4
Optical index of fault tolerant routings in WDM networks.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 95, doi. 10.1002/net.20351
- By:
- Publication type:
- Article
5
On superconnectivity of (4, g)-cages with even girth.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 143, doi. 10.1002/net.20355
- By:
- Publication type:
- Article
6
Simultaneous embeddings of graphs as median and antimedian subgraphs.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 90, doi. 10.1002/net.20350
- By:
- Publication type:
- Article
7
Kernelization and complexity results for connectivity augmentation problems.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 131, doi. 10.1002/net.20354
- By:
- Publication type:
- Article
8
Editorial: 2008 Glover-Klingman prize winners.
- Published in:
- Networks, 2010, v. 56, n. 2, p. 89, doi. 10.1002/net.20387
- By:
- Publication type:
- Article