"Analysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes."

Eduard Toman, Martin Stanek (2006)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2022-02-14

- view
  - electronic edition @ cai.sk (open access)
- export record
  dblp key:
  - journals/cai/TomanS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cai/TomanS06
Eduard Toman, Martin Stanek:
Analysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes. Comput. Artif. Intell. 25(5): 393-404 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.