Skip to content
Open Access
  • Home
  • Collections
    • High Impact Articles
    • Jawi Collection
    • Malay Medicine
    • Forensic
  • Search Options
    • UiTM Open Access
    • Search by UiTM Scopus
    • Advanced Search
    • Search by Category
  • Discovery Service
    • Sources
    • UiTM Journals
    • List UiTM Journal in IR
    • Statistic
  • About
    • Open Access
    • Creative Commons Licenses
    • COKI | Malaysia Open Access
    • User Guide
    • Contact Us
    • Search Tips
    • FAQs
Advanced
  • Graph approximation : issues a...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Graph approximation :
issues and complexity

Graph approximation : issues and complexity

Bibliographic Details
Main Author: Horton, Steven Bradish
Published: Georgia Institute of Technology 2008
Subjects:
Graph theory
Hypergraphs
Online Access:http://hdl.handle.net/1853/24830
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/1853/24830

Similar Items

  • On graph approximation heuristics : an application to vertex cover on planar graphs
    by: Meek, Darrin Leigh
    Published: (2008)
  • The optimal linear arrangement problem : algorithms and approximation
    by: Horton, Steven Bradish
    Published: (2009)
  • Connecting hitting sets and hitting paths in graphs
    by: Camby, Eglantine
    Published: (2015)
  • Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting
    by: Alimujiang Yasen, et al.
    Published: (2021-01-01)
  • Judicious partitions of graphs and hypergraphs
    by: Ma, Jie
    Published: (2011)

© 2020 | Services hosted by the Perpustakaan Tun Abdul Razak, | Universiti Teknologi MARA | Disclaimer


Loading...
Cannot write session to /tmp/vufind_sessions/sess_prghrgdld8os4e753hqkrq23ma