Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.
- Published in:
- Networks, 1998, v. 31, n. 1, p. 1, doi. 10.1002/(SICI)1097-0037(199801)31:1<1::AID-NET1>3.0.CO;2-N
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1998 AND VI 31 AND IP 1
Results: 5
1
2
Tough enough chordal graphs are Hamiltonian.
- Published in:
- Networks, 1998, v. 31, n. 1, p. 29, doi. 10.1002/(SICI)1097-0037(199801)31:1<29::AID-NET4>3.0.CO;2-M
- By:
- Publication type:
- Article
3
A branch and cut algorithm for the Steiner problem in graphs.
- Published in:
- Networks, 1998, v. 31, n. 1, p. 39, doi. 10.1002/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-L
- By:
- Publication type:
- Article
4
On capacitated stochastic chain problems in a network.
- Published in:
- Networks, 1998, v. 31, n. 1, p. 19, doi. 10.1002/(SICI)1097-0037(199801)31:1<19::AID-NET3>3.0.CO;2-N
- By:
- Publication type:
- Article
5
A strong lower bound for the Node Weighted Steiner Tree Problem.
- Published in:
- Networks, 1998, v. 31, n. 1, p. 11, doi. 10.1002/(SICI)1097-0037(199801)31:1<11::AID-NET2>3.0.CO;2-N
- By:
- Publication type:
- Article