File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Removing node and edge overlapping in graph layouts by a modified EGENET solver

TitleRemoving node and edge overlapping in graph layouts by a modified EGENET solver
Authors
Issue Date1999
Citation
Proceedings Of The International Conference On Tools With Artificial Intelligence, 1999, p. 218-225 How to Cite?
AbstractGraph layout problems such as node and edge overlapping occur widely in many industrial computer-aided design applications. Usually, these problems are handled in an ad hoc manner by some specially designed algorithms. GENET and its extended model EGENET are local search methods used to solve constraint satisfaction problems such as the car-sequencing problems efficiently. Both models use the min-conflict heuristic to update every finite-domain variable for finding local minima, and then apply heuristic learning rule(s) to escape the local minima not representing solution(s). In the past, few researchers have ever considered to apply any local search method like the EGENET approach to solve graph layout problems. In this paper, we consider how to modify the original EGENET model for solving the graph layout problems formulated as continuous constrained optimization problems. The empirical evaluation of different approaches on the graph layout problems demonstrated some advantages of our modified EGENET approach, which requires further investigation. More importantly, this interesting proposal opens up numerous opportunities for exploring the other possible ways to modify the original EGENET model, or using the other local search methods to solve these graph layout problems.
Persistent Identifierhttp://hdl.handle.net/10722/158276
ISSN

 

DC FieldValueLanguage
dc.contributor.authorTam, Vincenten_US
dc.date.accessioned2012-08-08T08:58:51Z-
dc.date.available2012-08-08T08:58:51Z-
dc.date.issued1999en_US
dc.identifier.citationProceedings Of The International Conference On Tools With Artificial Intelligence, 1999, p. 218-225en_US
dc.identifier.issn1063-6730en_US
dc.identifier.urihttp://hdl.handle.net/10722/158276-
dc.description.abstractGraph layout problems such as node and edge overlapping occur widely in many industrial computer-aided design applications. Usually, these problems are handled in an ad hoc manner by some specially designed algorithms. GENET and its extended model EGENET are local search methods used to solve constraint satisfaction problems such as the car-sequencing problems efficiently. Both models use the min-conflict heuristic to update every finite-domain variable for finding local minima, and then apply heuristic learning rule(s) to escape the local minima not representing solution(s). In the past, few researchers have ever considered to apply any local search method like the EGENET approach to solve graph layout problems. In this paper, we consider how to modify the original EGENET model for solving the graph layout problems formulated as continuous constrained optimization problems. The empirical evaluation of different approaches on the graph layout problems demonstrated some advantages of our modified EGENET approach, which requires further investigation. More importantly, this interesting proposal opens up numerous opportunities for exploring the other possible ways to modify the original EGENET model, or using the other local search methods to solve these graph layout problems.en_US
dc.languageengen_US
dc.relation.ispartofProceedings of the International Conference on Tools with Artificial Intelligenceen_US
dc.titleRemoving node and edge overlapping in graph layouts by a modified EGENET solveren_US
dc.typeConference_Paperen_US
dc.identifier.emailTam, Vincent:vtam@eee.hku.hken_US
dc.identifier.authorityTam, Vincent=rp00173en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0033350893en_US
dc.identifier.spage218en_US
dc.identifier.epage225en_US
dc.identifier.scopusauthoridTam, Vincent=7005091988en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats