Scielo RSS<![CDATA[Journal of the Brazilian Computer Society]]>
http://www.scielo.br/rss.php?pid=0104-650020010002&lang=en
vol. 7 num. 3 lang. en<![CDATA[SciELO Logo]]>http://www.scielo.br/img/en/fbpelogp.gif
http://www.scielo.br
<![CDATA[<b>Letter from the guest editors</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200001&lng=en&nrm=iso&tlng=en
<![CDATA[<b>Selected publications by Jayme Luiz Szwarcfiter</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200002&lng=en&nrm=iso&tlng=en
<![CDATA[<b>Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200003&lng=en&nrm=iso&tlng=en
This is an account of Jayme's contributions to Graph Theory and Computer Science. Due to restrictions in length, it is not possible to provide an in-depth coverage of every aspect of Jayme's extensive scientific activities. Thus, I describe in detail only some of his principal contributions, touch upon some and merely list the other articles. I found it easier to write the article in the first person, as though it is an account of a previously given lecture.<![CDATA[<b>A note on the complexity of scheduling coupled tasks on a single processor</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200004&lng=en&nrm=iso&tlng=en
This paper considers a problem of coupled task scheduling on one processor, where all processing times are equal to 1, the gap has exact length h, precedence constraints are strict and the criterion is to minimise the schedule length. This problem is introduced e.g. in systems controlling radar operations. We show that the general problem is NP-hard.<![CDATA[<b>Ramsey minimal graphs</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200005&lng=en&nrm=iso&tlng=en
As usual, for graphs <FONT FACE=Symbol>G</font>, G, and H, we write <FONT FACE=Symbol>G ®</FONT> (G, H) to mean that any red-blue colouring of the edges of gamma contains a red copy of G or a blue copy of H. A pair of graphs (G, H) is said to be Ramsey-infinite if there are infinitely many minimal graphs F for which we have <FONT FACE=Symbol>G ®</FONT> (G, H). Let l > 4 be an integer. We show that if H is a 2-connected graph that does not contain induced cycles of length at least l, then the pair (Ck,H) is Ramsey-infinite for any k > l, where Ck denotes the cycle of length k.<![CDATA[<b>Edge-clique graphs and the <FONT FACE=Symbol>l</FONT>-coloring problem</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200006&lng=en&nrm=iso&tlng=en
This paper deals with edge-clique graphs and with the lambda-coloring problem when restricted to this class. A characterization of edge-clique graphs of out-erplanar graphs is given; a complete description of edge-clique graphs of threshold graphs is presented and a linear time algorithm for lambda-coloring the edge-clique graph of a threshold graph is provided. A survey on the lambda-coloring problem, when restricted to edge-clique graphs, is reported.<![CDATA[<b>On the helly defect of a graph</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200007&lng=en&nrm=iso&tlng=en
The Helly defect of a graph G is the smallest integer i such that the iterated clique graph Ki(G) is clique-Kelly. We prove that it is NP-hard to decide whether the Helly defect of G is at most 1.<![CDATA[<b>Algebraic theory for the clique operator</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200008&lng=en&nrm=iso&tlng=en
In this text we attempt to unify many results about the K operator based on a new theory involving graphs, families and operators. We are able to build an ''operator algebra'' that helps to unify and automate arguments. In addition, we relate well-known properties, such as the Helly property, to the families and the operators. As a result, we deduce many classic results in clique graph theory from the basic fact that CS = I for conformal, reduced families. This includes Hamelink's construction, Roberts and Spencer theorem, and Ban-delt and Prisner's partial characterization of clique-fixed classes [2]. Furthermore, we show the power of our approach proving general results that lead to polynomial recognition of certain graph classes.<![CDATA[<b>Generating permutations and combinations in lexicographical order</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200009&lng=en&nrm=iso&tlng=en
We consider producing permutations and combinations in lexicographical order. Except for the array that holds the combinatorial object, we require only O(1) extra storage. The production of the next item requires O(1) amortized time.<![CDATA[<b>On the homotopy type of the clique graph</b>]]>
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200010&lng=en&nrm=iso&tlng=en
If G is a graph, its clique graph K(G) is the intersection graph of all its (maximal) cliques. The complex G<FONT FACE=Symbol></FONT> of a graph G is the simplicial complex whose simplexes are the vertex sets of the complete subgraphs of G. Here we study a sufficient condition for G<FONT FACE=Symbol></FONT> and K(G)<FONT FACE=Symbol></FONT> to be homotopic. Applying this result to Whitney triangulations of surfaces, we construct an infinite family of examples which solve in the affirmative Prisner's open problem 1 in Graph Dynamics (Longman, Harlow, 1995): Are there finite connected graphs G that are periodic under K and where the second modulo 2 Betti number is greater than 0?