Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system

A method and apparatus for coloring an interference graph yields a higher number of colored nodes by taking into consideration the colors of neighbors of a node's uncolored constrained neighbors. By assigning a color to a node that is also the color of a neighbor of an uncolored constrained nei...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	BAR-HAIM, ROY, ASNASH, LIVIU, EDELSTEIN, ORIT, AIZIKOWITZ, NAVA ARELA, NAMOLARU, MIRCEA, ROEDIGER, ROBERT RALPH, SCHMIDT, WILLIAM JON, PROSSER, EDWARD CURTIS
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue
container_start_page
container_title
container_volume
creator	BAR-HAIM ROY ASNASH LIVIU EDELSTEIN ORIT AIZIKOWITZ NAVA ARELA NAMOLARU MIRCEA ROEDIGER ROBERT RALPH SCHMIDT WILLIAM JON PROSSER EDWARD CURTIS
description	A method and apparatus for coloring an interference graph yields a higher number of colored nodes by taking into consideration the colors of neighbors of a node's uncolored constrained neighbors. By assigning a color to a node that is also the color of a neighbor of an uncolored constrained neighbor, one color constraint is removed, increasing the probability of coloring the uncolored constrained neighbor. If more than one of the neighbors of the uncolored constrained neighbors are colored, one of the colors may be selected over the others using an appropriate heuristic.
format	Patent
fullrecord	<record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US5774730A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US5774730A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US5774730A3</originalsourceid><addsrcrecordid>eNqFTLsKwkAQTGMh6je4PyAIUVJLUGys1DqsyV5ykOwee5tI_t4T7C1mhmEey2y6kXXSAHJCCKhoYwQnCn4IKpPnFmrpRfHle28ziEueoyl6pgZYGorgOR0kNlJHSlwTtIqhg7e37humzRDGFEOco9GwzhYO-0ibn66y7eX8KK87ClJRDFgTk1XP-7EoDkW-P-X_Gx9uJEWf</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system</title><source>esp@cenet</source><creator>BAR-HAIM; ROY ; ASNASH; LIVIU ; EDELSTEIN; ORIT ; AIZIKOWITZ; NAVA ARELA ; NAMOLARU; MIRCEA ; ROEDIGER; ROBERT RALPH ; SCHMIDT; WILLIAM JON ; PROSSER; EDWARD CURTIS</creator><creatorcontrib>BAR-HAIM; ROY ; ASNASH; LIVIU ; EDELSTEIN; ORIT ; AIZIKOWITZ; NAVA ARELA ; NAMOLARU; MIRCEA ; ROEDIGER; ROBERT RALPH ; SCHMIDT; WILLIAM JON ; PROSSER; EDWARD CURTIS</creatorcontrib><description>A method and apparatus for coloring an interference graph yields a higher number of colored nodes by taking into consideration the colors of neighbors of a node's uncolored constrained neighbors. By assigning a color to a node that is also the color of a neighbor of an uncolored constrained neighbor, one color constraint is removed, increasing the probability of coloring the uncolored constrained neighbor. If more than one of the neighbors of the uncolored constrained neighbors are colored, one of the colors may be selected over the others using an appropriate heuristic.</description><edition>6</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>1998</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19980630&DB=EPODOC&CC=US&NR=5774730A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76418</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19980630&DB=EPODOC&CC=US&NR=5774730A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>BAR-HAIM; ROY</creatorcontrib><creatorcontrib>ASNASH; LIVIU</creatorcontrib><creatorcontrib>EDELSTEIN; ORIT</creatorcontrib><creatorcontrib>AIZIKOWITZ; NAVA ARELA</creatorcontrib><creatorcontrib>NAMOLARU; MIRCEA</creatorcontrib><creatorcontrib>ROEDIGER; ROBERT RALPH</creatorcontrib><creatorcontrib>SCHMIDT; WILLIAM JON</creatorcontrib><creatorcontrib>PROSSER; EDWARD CURTIS</creatorcontrib><title>Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system</title><description>A method and apparatus for coloring an interference graph yields a higher number of colored nodes by taking into consideration the colors of neighbors of a node's uncolored constrained neighbors. By assigning a color to a node that is also the color of a neighbor of an uncolored constrained neighbor, one color constraint is removed, increasing the probability of coloring the uncolored constrained neighbor. If more than one of the neighbors of the uncolored constrained neighbors are colored, one of the colors may be selected over the others using an appropriate heuristic.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>1998</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqFTLsKwkAQTGMh6je4PyAIUVJLUGys1DqsyV5ykOwee5tI_t4T7C1mhmEey2y6kXXSAHJCCKhoYwQnCn4IKpPnFmrpRfHle28ziEueoyl6pgZYGorgOR0kNlJHSlwTtIqhg7e37humzRDGFEOco9GwzhYO-0ibn66y7eX8KK87ClJRDFgTk1XP-7EoDkW-P-X_Gx9uJEWf</recordid><startdate>19980630</startdate><enddate>19980630</enddate><creator>BAR-HAIM; ROY</creator><creator>ASNASH; LIVIU</creator><creator>EDELSTEIN; ORIT</creator><creator>AIZIKOWITZ; NAVA ARELA</creator><creator>NAMOLARU; MIRCEA</creator><creator>ROEDIGER; ROBERT RALPH</creator><creator>SCHMIDT; WILLIAM JON</creator><creator>PROSSER; EDWARD CURTIS</creator><scope>EVB</scope></search><sort><creationdate>19980630</creationdate><title>Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system</title><author>BAR-HAIM; ROY ; ASNASH; LIVIU ; EDELSTEIN; ORIT ; AIZIKOWITZ; NAVA ARELA ; NAMOLARU; MIRCEA ; ROEDIGER; ROBERT RALPH ; SCHMIDT; WILLIAM JON ; PROSSER; EDWARD CURTIS</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US5774730A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1998</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>BAR-HAIM; ROY</creatorcontrib><creatorcontrib>ASNASH; LIVIU</creatorcontrib><creatorcontrib>EDELSTEIN; ORIT</creatorcontrib><creatorcontrib>AIZIKOWITZ; NAVA ARELA</creatorcontrib><creatorcontrib>NAMOLARU; MIRCEA</creatorcontrib><creatorcontrib>ROEDIGER; ROBERT RALPH</creatorcontrib><creatorcontrib>SCHMIDT; WILLIAM JON</creatorcontrib><creatorcontrib>PROSSER; EDWARD CURTIS</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>BAR-HAIM; ROY</au><au>ASNASH; LIVIU</au><au>EDELSTEIN; ORIT</au><au>AIZIKOWITZ; NAVA ARELA</au><au>NAMOLARU; MIRCEA</au><au>ROEDIGER; ROBERT RALPH</au><au>SCHMIDT; WILLIAM JON</au><au>PROSSER; EDWARD CURTIS</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system</title><date>1998-06-30</date><risdate>1998</risdate><abstract>A method and apparatus for coloring an interference graph yields a higher number of colored nodes by taking into consideration the colors of neighbors of a node's uncolored constrained neighbors. By assigning a color to a node that is also the color of a neighbor of an uncolored constrained neighbor, one color constraint is removed, increasing the probability of coloring the uncolored constrained neighbor. If more than one of the neighbors of the uncolored constrained neighbors are colored, one of the colors may be selected over the others using an appropriate heuristic.</abstract><edition>6</edition><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier
ispartof
issn
language	eng
recordid	cdi_epo_espacenet_US5774730A
source	esp@cenet
subjects	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
title	Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T08%3A51%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=BAR-HAIM;%20ROY&rft.date=1998-06-30&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS5774730A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true